63 search results - page 10 / 13 » Kernelization as Heuristic Structure for the Vertex Cover Pr... |
MP
1998
13 years 10 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
The paper presents an approach based on principles of immune systems to the anomaly detection problem. Flexibility and efficiency of the anomaly detection system are achieved by b...
CONSTRAINTS
2007
13 years 11 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
WADS
2009
Springer
14 years 5 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...