I. Devarenne-]-devarenne, Études en recherche locale adaptative pour l'optimisation combinatoire, 2007.

F. Fleurent, C. Fleurent, and J. Ferland, Object-oriented implementation of heuristics search methods for Graph Coloring, Maximum Clique, and Satisfiability, [Johnson and Trick, pp.619-652, 1996.

. Galinier, . Hao, P. Galinier, and J. Hao, Tabu search for maximal constraint satisfaction problems, Third International Conference on Principles and Practice of Constraint Programming (CP97), pp.196-208, 1997.
DOI : 10.1007/BFb0017440

. Galinier, . Hao, P. Galinier, and J. Hao, Hybrid evolutionary algorithms for graph coloring, Journal of Combinatorial Optimization, vol.3, issue.4, pp.379-397, 1999.
DOI : 10.1023/A:1009823419804

. Galinier, . Hao, P. Galinier, and J. Hao, A General Approach for Constraint Solving by Local Search, Journal of Mathematical Modelling and Algorithms, vol.3, issue.1, pp.73-88, 2004.
DOI : 10.1023/B:JMMA.0000026709.24659.da

. Galinier, . Hertz, 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

F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

P. Hansen, N. Mladenovi´cmladenovi´c, L. Cahiers, H. Gerad, . Montreal et al., A Tutorial on Variable Neighborhood Search, 2003.

D. Hertz, . Werra, 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