1. A variable neighborhood search for graph coloring;Avanthay;European Journal of Operational Research,2003
2. A graph coloring heuristic using partial solutions and a reactive tabu scheme;Blöchliger;Computers and Operations Research,2008
3. A graph-based hyper heuristic for timetabling problems;Burke;European Journal of Operational Research,2007
4. Some experiments with simulated annealing for coloring graphs;Chams;European Journal of Operational Research,1987
5. Chiarandini M, Stützle T. An application of iterated local search to graph coloring. In: Johnson DS, Mehrotra A, Trick M, editors. Proceedings of the computational symposium on graph coloring and its generalizations, Ithaca, New York, USA; 2002. p. 112–25.