C. Avanthay, A. Hertz, and N. Zufferey, A variable neighborhood search for graph coloring, European Journal of Operational Research, vol.151, issue.2, pp.379-388, 2003.
DOI : 10.1016/S0377-2217(02)00832-9

U. Bastolla, M. Porto, H. E. Roman, and M. Vendruscolo, Statistical Properties of Neutral Evolution, Journal of Molecular Evolution, vol.57, issue.0, pp.103-119, 2003.
DOI : 10.1007/s00239-003-0013-4

H. Bouziri, K. Mellouli, and E. G. Talbi, The k-coloring fitness landscape, Journal of Combinatorial Optimization, vol.38, issue.3, pp.306-329, 2011.
DOI : 10.1007/s10878-009-9249-2
URL : https://hal.archives-ouvertes.fr/hal-00836736

D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.
DOI : 10.1145/359094.359101

P. Briggs, K. D. Cooper, and L. Torczon, Improvements to graph coloring register allocation, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.428-455, 1994.
DOI : 10.1145/177492.177575

M. Caramia, P. Dell-'olmo, and G. F. Italiano, CHECKCOL: Improved local search for graph coloring, Journal of Discrete Algorithms, vol.4, issue.2, pp.277-298, 2006.
DOI : 10.1016/j.jda.2005.03.006
URL : http://doi.org/10.1016/j.jda.2005.03.006

M. Chams, A. Hertz, and D. De-werra, Some experiments with simulated annealing for coloring graphs, European Journal of Operational Research, vol.32, issue.2, pp.260-266, 1987.
DOI : 10.1016/S0377-2217(87)80148-0

C. Fleurent and J. Ferland, Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, vol.22, issue.3, pp.437-461, 1996.
DOI : 10.1007/BF02125407

P. Galinier and A. Hertz, A survey of local search methods for graph coloring, Computers & Operations Research, vol.33, issue.9, pp.2547-2562, 2006.
DOI : 10.1016/j.cor.2005.07.028

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP- Completeness, 1990.

A. Hertz and D. De-werra, Die Tabu-Methoden zur Graphenf??rbung, Computing, vol.21, issue.4, pp.345-351, 1987.
DOI : 10.1007/BF02239976

V. Maniezzo and A. Carbonaro, An ANTS heuristic for the frequency assignment problem, Future Generation Computer Systems, vol.16, issue.8, pp.927-935, 2000.
DOI : 10.1016/S0167-739X(00)00046-7

M. É. Marmion, C. Dhaenens, L. Jourdan, A. Liefooghe, and S. Verel, NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling, Proceedings of the 12th European Conference of Evolutionary Computation in Combinatorial Optimization, pp.191-202, 2011.
DOI : 10.1007/978-3-642-20364-0_17
URL : https://hal.archives-ouvertes.fr/hal-00563459

M. É. Marmion, C. Dhaenens, L. Jourdan, A. Liefooghe, and S. Verel, On the Neutrality of Flowshop Scheduling Fitness Landscapes, Proceedings of the 5th Learning and Intelligent OptimizatioN Conference, pp.238-252, 2011.
DOI : 10.1007/BF00202749
URL : https://hal.archives-ouvertes.fr/hal-00550356

M. É. Marmion, L. Jourdan, and C. Dhaenens, Fitness Landscape Analysis and Metaheuristics Efficiency, Journal of Mathematical Modelling and Algorithms, vol.63, issue.99, 2013.
DOI : 10.1007/s10852-012-9177-5
URL : https://hal.archives-ouvertes.fr/hal-00807352

P. Merz and B. Freisleben, Memetic algorithms for the traveling salesman problem, Complex Systems, vol.13, pp.297-345, 1997.

P. Merz and B. Freisleben, Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Transactions on Evolutionary Computation, vol.4, issue.4, pp.337-352, 2000.

L. Paquete and T. Stutzle, An Experimental Investigation of Iterated Local Search for Coloring Graphs, Applications of Evolutionary Computing, pp.122-131, 2002.
DOI : 10.1007/3-540-46004-7_13

D. C. Porumbel, J. K. Hao, and P. Kuntz, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Computers & Operations Research, vol.37, issue.10, pp.1822-1832, 2010.
DOI : 10.1016/j.cor.2010.01.015
URL : https://hal.archives-ouvertes.fr/hal-00453545

D. C. Porumbel, J. K. Hao, and P. Kuntz, A search space ???cartography??? for guiding graph coloring heuristics, Computers & Operations Research, vol.37, issue.4, pp.769-778, 2010.
DOI : 10.1016/j.cor.2009.06.024
URL : https://hal.archives-ouvertes.fr/hal-00421673

C. M. Reidys and P. F. Stadler, Neutrality in fitness landscapes, Applied Mathematics and Computation, vol.117, issue.2-3, pp.321-350, 2001.
DOI : 10.1016/S0096-3003(99)00166-6

P. F. Stadler, Landscapes and their correlation functions, Journal of Mathematical Chemistry, vol.145, issue.1, pp.1-45, 1996.
DOI : 10.1007/BF01165154

M. Trick and H. Yildiz, A Large Neighborhood Search Heuristic for Graph Coloring, LNCS, vol.4510, pp.346-360, 2007.
DOI : 10.1007/978-3-540-72397-4_25

S. Verel, P. Collard, and M. Clergue, Scuba search: when selection meets innovation, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), pp.924-931, 2004.
DOI : 10.1109/CEC.2004.1330960
URL : https://hal.archives-ouvertes.fr/hal-00160035

S. Verel, P. Collard, M. Tomassini, and L. Vanneschi, Fitness landscape of the cellular automata majority problem: View from the ???Olympus???, Theoretical Computer Science, vol.378, issue.1, pp.54-77, 2007.
DOI : 10.1016/j.tcs.2007.01.001
URL : https://hal.archives-ouvertes.fr/hal-00164772

E. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics, vol.1, issue.5, pp.325-336, 1990.
DOI : 10.1007/BF00202749

C. O. Wilke, Adaptive Evolution on Neutral Networks, Bulletin of Mathematical Biology, vol.63, issue.4, pp.715-730, 2001.
DOI : 10.1006/bulm.2001.0244

S. Wright, The roles of mutation, inbreeding, crossbreeding and selection in evolution, Proceedings of the Sixth International Congress on Genetics, 1932.

N. Zufferey, P. Amstutz, and P. Giaccari, Graph colouring approaches for a satellite range scheduling problem, Journal of Scheduling, vol.46, issue.3, pp.263-277, 2008.
DOI : 10.1007/s10951-008-0066-8