Ant Local Search and its efficient adaptation to graph colouring
Year of publication: |
2010
|
---|---|
Authors: | Plumettaz, M. ; Schindl, D. ; Zufferey, Nicolas |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 61.2010, 5, p. 819-826
|
Subject: | Graphentheorie | Graph theory | Heuristik | Heuristics | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
Solving shortest path problems with a weight constraint and replenishment arcs
Smith, Olivia J., (2012)
-
A derandomized approximation algorithm for the critical node detection problem
Ventresca, Mario, (2014)
-
Process flexibility revisited : the graph expander and its applications
Chou, Mabel C., (2011)
- More ...
-
Bissoli, Dayan C., (2019)
-
Tabu search for a single machine scheduling problem with rejected jobs, setups and deadlines
Thevenin, Simon, (2012)
-
Metaheuristics for a single machine scheduling problem with penalty, setup and abandon costs
Thevenin, Simon, (2012)
- More ...