Coloring large graphs based on independent set extraction

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1989 · 1.5K citations

Computing, Computer Science, Algorithms +13

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1991 · 844 citations

Natural Sciences, Computer Science, Mathematics +16

Using tabu search techniques for graph coloring

Alain Hertz, D. de Werra · Computing · 1987 · 660 citations · Full text

Natural Sciences, Computer Science, Combinatorics +9

A fast algorithm for the maximum clique problem

Patric R. J. Östergård · Discrete Applied Mathematics · 2002 · 598 citations

Natural Sciences, Computer Science, Mathematics +10

A graph-based hyper-heuristic for educational timetabling problems

Edmund Burke, Barry McCollum, Amnon Meisels et al. · European Journal of Operational Research · 2005 · 503 citations · Full text

Computing, Computer Science, Algorithms +7