A new genetic local search algorithm for graph coloring
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 745-754
- https://doi.org/10.1007/bfb0056916
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Tabu SearchPublished by Springer Nature ,1997
- Genetic and hybrid algorithms for graph coloringAnnals of Operations Research, 1996
- New genetic local search operators for the traveling salesman problemPublished by Springer Nature ,1996
- A hybrid grouping genetic algorithm for bin packingJournal of Heuristics, 1996
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphsJournal of Heuristics, 1995
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Using tabu search techniques for graph coloringComputing, 1987
- Some experiments with simulated annealing for coloring graphsEuropean Journal of Operational Research, 1987
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- A graph coloring algorithm for large scheduling problemsJournal of Research of the National Bureau of Standards, 1979