Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- 1 September 1995
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 1 (1) , 105-128
- https://doi.org/10.1007/bf02430368
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Genetic hybrids for the quadratic assignment problemPublished by American Mathematical Society (AMS) ,1994
- Genetic algorithms and scatter search: unsuspected potentialsStatistics and Computing, 1994
- Epcot: An efficient procedure for coloring optimally with Tabu SearchComputers & Mathematics with Applications, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graphComputers & Operations Research, 1990
- Simulated annealing: A tool for operational researchEuropean Journal of Operational Research, 1990
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 1989
- Minimax relations for the partial q- colorings of a graphDiscrete Mathematics, 1989
- 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