Genetic and hybrid algorithms for graph coloring
- 1 June 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 63 (3) , 437-461
- https://doi.org/10.1007/bf02125407
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Genetic hybrids for the quadratic assignment problemPublished by American Mathematical Society (AMS) ,1994
- The Reactive Tabu SearchINFORMS Journal on Computing, 1994
- Dynamic tabu list management using the reverse elimination methodAnnals of Operations Research, 1993
- Parallel biased search for combinatorial optimization: genetic algorithms and TABUMicroprocessors and Microsystems, 1992
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 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
- A graph coloring algorithm for large scheduling problemsJournal of Research of the National Bureau of Standards, 1979
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965