Coloring graphs by iterated local search traversing feasible and infeasible solutions
Authors:
- Massimiliano CaramiaMCMassimiliano Caramia
- Paolo Dell’oLmoPDPaolo Dell’oLmo
- 1 January 2008
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 156 (2) , 201-217
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- CHECKCOL: Improved local search for graph coloringJournal of Discrete Algorithms, 2006
- Constraint Propagation in Graph ColoringJournal of Heuristics, 2002
- Iterative coloring extension of a maximum cliqueNaval Research Logistics (NRL), 2001
- Graph Coloring with Adaptive Evolutionary AlgorithmsJournal of Heuristics, 1998
- Some experiments with simulated annealing for coloring graphsEuropean Journal of Operational Research, 1987
- An introduction to timetablingEuropean Journal of Operational Research, 1985
- An Introduction to Combinatorial Models of Dynamic Storage AllocationSIAM Review, 1983
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-completeDiscrete Mathematics, 1980
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Chromatic Scheduling and the Chromatic Number ProblemManagement Science, 1972