I. Routine-of and .. , LCV+IIS of constraints detector on average runtime compared to wcore, p.86

R. 1. Chinneck and J. W. , Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods, 2007.

J. N. Van-loon, Irreducibly inconsistent systems of linear inequalities, European Journal of Operational Research, vol.8, issue.3, pp.283-288, 1981.
DOI : 10.1016/0377-2217(81)90177-6

P. Galinier and A. Hertz, Solution techniques for the Large Set Covering Problem, Discrete Applied Mathematics, vol.155, issue.3, pp.312-326, 2007.
DOI : 10.1016/j.dam.2006.04.043

E. Freuder and R. Wallace, Introduction to the special volume on constraint-based reasoning, Artificial Intelligence, vol.58, issue.1-3, pp.1-3
DOI : 10.1016/0004-3702(92)90002-F

A. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

E. Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.
DOI : 10.1145/322290.322292

Y. Zhang and R. Yap, Making AC-3 an optimal algorithm, Proceedings IJCAI'01, pp.316-321, 2001.

R. Mohr and T. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

C. Bessì-ere, Arc-consistency and arc-consistency again, Artificial Intelligence, vol.65, issue.1, pp.179-190, 1994.
DOI : 10.1016/0004-3702(94)90041-8

J. Cbessì-ere,-régin, Refining the basic constraint propagation algorithm, Proceedings IJCAI'01, pp.309-315, 2001.

D. Mehta and M. Van-dongen, Two new lightweight arc consistency algorithms, Proceedings of the CP'04 Workshop on Constraint Propagation and Implementation, pp.109-123, 2004.

F. Boussemart, F. Hemery, and C. Lecoutre, Revision ordering heuristics for the constraint satisfaction problem, Proceedings of the CP'04 Workshop on Constraint Propagation and Implementation, pp.29-44, 2004.

A. K. Mackworth, On reading sketch maps, Proceedings of the 5th international joint conference on Artificial intelligence, pp.598-606, 1977.

R. Wallace, Why AC-3 is almost always better than AC-4 for establishing arc consistency in csps, Proceedings IJCAI'93

T. Berlandier, Improving domain filtering using restricted path consistency, Proceedings the 11th Conference on Artificial Intelligence for Applications, 1995.
DOI : 10.1109/CAIA.1995.378792
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.540

E. Freuder and C. Elfe, Neighborhood inverse consistency preprocessing, Proceedings AAAI'96, pp.202-208, 1996.

R. Debruyne and C. Bessì-ere, From restricted path consistency to max-restricted path consistency, Proceedings IJCAI'97, pp.312-326, 1997.
DOI : 10.1007/BFb0017448

R. Debruyne, A property of path inverse consistency leading to an optimal PIC algorithm, Proceedings ECAI'00, pp.88-92, 2000.

R. Dechter and J. Pearl, Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence, vol.34, issue.1, pp.1-38, 1988.
DOI : 10.1016/0004-3702(87)90002-6

M. Haralick and G. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

D. Frost and R. Dechter, Dead-end driven learning, Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), pp.294-300, 1994.

J. Gaschnig, Performance measurement and analysis of search algorithms, 1979.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.41-273, 1990.
DOI : 10.1016/0004-3702(90)90046-3

G. Katsirelos and F. Bacchus, Unrestricted Nogood Recording in CSP Search, In: IN PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, pp.873-877, 2003.
DOI : 10.1007/978-3-540-45193-8_70

J. R. Bayardo and D. P. Miranker, A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem

M. Dib, A. Caminada, and H. Mabed, Nogood Recording with Tabu Search for CSP (Application to FAP), 2009 Third Asia International Conference on Modelling & Simulation, pp.218-223, 2009.
DOI : 10.1109/AMS.2009.106

D. Sabin and E. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of ECAI'94, pp.125-129, 1994.
DOI : 10.1007/3-540-58601-6_86

C. Bessì-ere and J. Régin, MAC and combined heuristics : two reasons to forsake FC (and CBJ?) on hard problems, Proceedings of CP'96, pp.61-75, 1996.

M. Van-dongen, AC3 d an efficient arc-consistency algorithm with a low space-complexity, 2002.

M. Van-dongen, Lightweight MAC Algorithms, 2003.
DOI : 10.1007/978-0-85729-412-8_17

C. Likitvivatanavong, Y. Zhang, J. Bowen, and E. Freuder, Arc consistency in MAC: A new perspective, Proceedings Constraint Propagation and Implementation, first International workshop, pp.93-108, 2004.

J. Régin, Maintaining arc consistency algorithms during the search with an optimal time and space complexity, Proceedings Constraint Propagation and Implementation, first International workshop, pp.125-138, 2004.

M. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.
DOI : 10.1007/3-540-58601-6_105
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.4126

N. Jussien, R. Debruyne, and P. Boizumault, Maintaining Arc-Consistency within Dynamic Backtracking, Proceedings of Principles and Practice of Constraint Programming, pp.249-261, 2000.
DOI : 10.1007/3-540-45349-0_19
URL : https://hal.archives-ouvertes.fr/hal-00869126

R. M. Karp, T. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank et al., Reducibility among combinatorial problems Years of Integer Programming, pp.50-219, 1958.

S. J. Russell, P. Norvig, J. F. Candy, J. M. Malik, and D. D. Edwards, Artificial intelligence: a modern approach, 1996.

J. C. Beck, P. Prosser, and R. J. Wallace, Toward understanding variable ordering heuristics for constraint satisfaction problems, Proceedings of the Fourteenth Irish Artificial Intelligence and Cognitive Science Conference, pp.11-16, 2003.

R. J. Wallace, DETERMINING THE PRINCIPLES UNDERLYING PERFORMANCE VARIATION IN CSP HEURISTICS, International Journal on Artificial Intelligence Tools, vol.17, issue.05, pp.857-880, 2008.
DOI : 10.1142/S0218213008004199

M. Vernooy and W. S. Havens, An Examination of Probabilistic Value-Ordering Heuristics, Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence. AI '99, pp.340-352, 1999.
DOI : 10.1007/3-540-46695-9_29

D. Frost and R. Dechter, Look-ahead value ordering for constraint satisfaction problems, Proceedings of International Joint Conference on Artificial Intelligence IJCAI-95, pp.572-578, 1995.

C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Nogood recording from restarts, Proceedings of the 20th international joint conference on Artifical intelligence. IJCAI'07, pp.131-136, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261264

R. Wallace, Analysis of Heuristic Synergies
DOI : 10.1007/11402763_4

S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence, vol.58, issue.1-3, pp.1-3, 1992.
DOI : 10.1016/0004-3702(92)90007-K

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. Morris, The breakout method for escaping from local minima, Proceceeding of the 11th National Conference on Artificial Intelligence, pp.40-45, 1993.

A. Dupont, E. Alvernhe, and M. Vasquez, Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation, Annals of Operations Research, vol.130, issue.1-4, pp.179-198, 2004.
DOI : 10.1023/B:ANOR.0000032575.38969.ab
URL : https://hal.archives-ouvertes.fr/hal-00353829

P. Galinier and J. K. 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

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

J. Gu, P. W. Purdom, J. Franco, and B. W. Wah, Algorithms for the Satisfiability (SAT) Problem, Satisfiability Problem: Theory and applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science
DOI : 10.1007/978-1-4757-3023-4_7

E. A. Hirsch, SAT local search algorithms: Worst-case study, Journal of Automated Reasoning, vol.24, issue.1/2, pp.127-143, 2000.
DOI : 10.1023/A:1006318521185
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7670

H. H. Hoos and T. Stützle, Local search algortihms for SAT: An empirical evaluation, Journal of Automated Reasoning, vol.24, issue.4, pp.421-481, 2000.
DOI : 10.1023/A:1006350622830

I. Lynce, L. Baptista, and J. Marques-silva, Stochastic Systematic Search Algorithms for Satisfiability, Electronic Notes in Discrete Mathematics, vol.9, issue.0, pp.190-204, 2001.
DOI : 10.1016/S1571-0653(04)00322-1

J. N. Van-loon, Irreducibly inconsistent systems of linear inequalities, European Journal of Operational Research, vol.8, issue.3, pp.283-288, 1981.
DOI : 10.1016/0377-2217(81)90177-6

J. W. Chinneck, Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program, INFORMS Journal on Computing, vol.9, issue.2, pp.164-174, 1997.
DOI : 10.1287/ijoc.9.2.164

J. Gleeson and J. Ryan, Identifying Minimally Infeasible Subsystems of Inequalities, ORSA Journal on Computing, vol.2, issue.1, pp.61-63, 1990.
DOI : 10.1287/ijoc.2.1.61

H. J. Greenberg and F. H. Murphy, Approaches to Diagnosing Infeasible Linear Programs, ORSA Journal on Computing, vol.3, issue.3, pp.253-261, 1991.
DOI : 10.1287/ijoc.3.3.253

´. E. Grégoire, B. Mazure, and C. Piette, Local-search Extraction of MUSes, Constraints, vol.37, issue.1, pp.325-344, 2007.
DOI : 10.1007/s10601-007-9019-7

F. Hemery, C. Lecoutre, L. Sais, and F. Boussemart, Extracting MUCs from constraint networks, In: ECAI, pp.113-117, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00110096

J. Marques-silva, Minimal unsatisfiability: Models, algorithms and applications (invited paper) In: Multiple-Valued Logic (ISMVL), 40th IEEE International Symposium on, pp.9-14, 2010.

´. E. Grégoire, B. Mazure, and C. Piette, On Approaches to Explaining Infeasibility of Sets of Boolean Clauses, 2008 20th IEEE International Conference on Tools with Artificial Intelligence, pp.74-83, 2008.
DOI : 10.1109/ICTAI.2008.39

C. Piette, Y. Hamadi, and L. Sa¨?ssa¨?s, Efficient Combination of Decision Procedures for MUS Computation, Proceedings of the 7th international conference on Frontiers of combining systems. FroCoS'09, pp.335-349, 2009.
DOI : 10.1007/978-3-540-31980-1_1

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of ECAI'04, pp.146-150, 2004.

´. E. Grégoire, B. Mazure, and C. Piette, ON FINDING MINIMALLY UNSATISFIABLE CORES OF CSPs, International Journal on Artificial Intelligence Tools, vol.17, issue.04, pp.745-763, 2008.
DOI : 10.1142/S0218213008004138

L. Zhang and S. Malik, Extracting small unsatisfiable cores from unsatisfiable boolean formula, Proceedings of Theory and Applications of satisfiability Testing (SAT'03, 2003.

L. Zhang, Searching for truth: techniques for satisfiability of boolean formulas, p.3102236, 2003.

Y. Oh, M. N. Mneimneh, Z. S. Andraus, K. A. Sakallah, and I. L. Markov, AMUSE, Proceedings of the 41st annual conference on Design automation , DAC '04, pp.518-523, 2004.
DOI : 10.1145/996566.996710

C. Eisenberg and B. Faltings, Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems, Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP-2003), 2003.
DOI : 10.1007/978-3-540-45193-8_60

B. Mazure, L. Sa¨?ssa¨?s, and ´. E. Grégoire, Boosting complete techniques thanks to local search methods, Annals of Mathematics and Artificial Intelligence, vol.22, issue.3/4, pp.319-331, 1998.
DOI : 10.1023/A:1018999721141

H. Kautz, B. Selman, and D. Mcallester, Walksat in the sat 2004 competition, International Conference on Theory and Applications of Satisfiability Testing, 2004.

H. Van-maaren and S. Wieringa, Finding Guaranteed MUSes??Fast, Proceedings of the 11th international conference on Theory and applications of satisfiability testing. SAT'08, pp.291-304, 2008.
DOI : 10.1007/978-3-540-79719-7_27

M. G. De-la-banda, P. J. Stuckey, and J. Wazny, Finding all minimal unsatisfiable subsets, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming , PPDP '03, pp.32-43, 2003.
DOI : 10.1145/888251.888256

R. Bruni and A. Sassano, Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances, In: CP, pp.495-499, 2000.
DOI : 10.1007/3-540-45349-0_37

M. H. Liffiton and K. A. Sakallah, On Finding All Minimally Unsatisfiable Subformulas, in International Conf. on Theory and Applications of Satisfiability Testing, pp.173-186, 2005.
DOI : 10.1007/11499107_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.4819

R. Bruni, Approximating minimal unsatisfiable subformulae by means of adaptive core search, Discrete Applied Mathematics, vol.130, issue.2, pp.85-100, 2003.
DOI : 10.1016/S0166-218X(02)00399-2

C. Desrosiers, P. Galinier, and A. Hertz, Efficient algorithms for finding critical subgraphs, Discrete Applied Mathematics, vol.156, issue.2, pp.244-266, 2008.
DOI : 10.1016/j.dam.2006.07.019
URL : http://doi.org/10.1016/j.dam.2006.07.019

J. Bailey, T. Manoukian, and K. Ramamohanarao, A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns, Third IEEE International Conference on Data Mining, p.485, 2003.
DOI : 10.1109/ICDM.2003.1250958

J. Bailey and P. J. Stuckey, Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization, Proc. of the 7th International Symposium on Practical Aspects of Declarative Languages (PADL05, pp.174-186, 2005.
DOI : 10.1007/978-3-540-30557-6_14

M. H. Liffiton, M. D. Moffitt, M. E. Pollack, and K. A. Sakallah, Identifying conflicts in overconstrained temporal problems, Proceedings of the 19th international joint conference on Artificial intelligence, pp.205-211, 2005.

C. Desrosiers, P. Galinier, A. Hertz, and S. Paroz, Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems, Journal of Combinatorial Optimization, vol.24, issue.1, pp.124-150, 2009.
DOI : 10.1007/s10878-008-9142-4

M. Liffiton and K. Sakallah, Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints, Journal of Automated Reasoning, vol.17, issue.1, pp.1-33, 2008.
DOI : 10.1007/s10817-007-9084-z

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

Z. Fu and S. Malik, On Solving the Partial MAX-SAT Problem, In: SAT, pp.252-265, 2006.
DOI : 10.1007/11814948_25

K. Aardal, S. Van-hoesel, A. Koster, C. Mannino, and A. Sassano, Models and solution techniques for frequency assignment problems, Annals of Operations Research, vol.19, issue.1???4
DOI : 10.1007/s10479-007-0178-0

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

A. Gondran, Modélisation et optimisation des réseaux locaux sans fil Wireless local area network modeling and optimization, 2008.

H. Mabed, A. Caminada, J. K. Hao, and D. Renaud, A Dynamic Traffic Model for Frequency Assignment, In: PPSN, pp.779-788, 2002.
DOI : 10.1007/3-540-45712-7_75

M. Dib, Tabu-NG:hybridation de programmation par contraintes et recherche locale pour la résolution de CSP, 2010.

A. Gondran, O. Baala, H. Mabed, and A. Caminada, Hypergraph T-coloring for automatic frequency planning problem in wireless LAN, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications
DOI : 10.1109/PIMRC.2008.4699726

B. Cabon, S. De-givry, L. Lobjois, T. Schiex, and J. P. Warners, Radio link frequency assignment, Constraints, vol.4, issue.1, pp.79-89, 1999.
DOI : 10.1023/A:1009812409930

H. Van-benthem, Graph: generating radiolink frequency assignment problems heuristically, 1995.

A. M. Koster, S. P. Van-hoesel, and A. W. Kolen, The partial constraint satisfaction problem: Facets and lifting theorems, Operations Research Letters, vol.23, issue.3-5
DOI : 10.1016/S0167-6377(98)00043-1

T. Defaix, FAPP ?probì emes d'allocation de fréquences avec polarisation, 2003.

J. Hu, P. Galinier, and A. Caminada, On identifying infeasible subsets in constraint satisfaction problems, In: ICAI, pp.615-619, 2010.

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

P. Galinier, M. Gendreau, P. Soriano, and S. Bisaillon, Solving the frequency assignment problem with polarization by local search and tabu, 4OR, vol.3, issue.1, pp.59-78, 2005.
DOI : 10.1007/s10288-004-0056-4

J. Hu, P. Galinier, and A. Caminada, Yet another breakout inspired infeasible subset detection in constraint satisfaction problem, In: ICAI, 2011.

A. Mehrotra and M. Trick, A Column Generation Approach for Graph Coloring, INFORMS Journal on Computing, vol.8, issue.4, pp.344-354, 1996.
DOI : 10.1287/ijoc.8.4.344

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

R. Diestel, Graph Theory (Graduate Texts in Mathematics), 2005.

M. Chiarandini, I. Dumitrescu, and T. Stützle, Stochastic local search algorithms for the graph colouring problem: Handbook of Approximation Algorithms and Metaheuristics, Computer & Information Science Series. Chapman & Hall/CRC, pp.63-64, 2007.

E. Malaguti and P. Toth, A survey on vertex coloring problems, International Transactions in Operational Research, vol.39, issue.12, pp.1-34, 2010.
DOI : 10.1111/j.1475-3995.2009.00696.x

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

V. Kumar, Algorithms for constraint satisfaction problems: A survey, AI MAGAZINE, vol.13, issue.1, pp.32-44, 1992.

Z. Lu and J. K. Hao, A memetic algorithm for graph coloring, European Journal of Operational Research, vol.203, issue.1, pp.241-250, 2010.
DOI : 10.1016/j.ejor.2009.07.016

F. T. Leighton, A graph coloring algorithm for large scheduling problems, Journal of Research of the National Bureau of Standards, vol.84, issue.6, pp.489-506, 1979.
DOI : 10.6028/jres.084.024

D. S. Johnson, C. R. Aragon, L. A. Mcgeoch, and C. Schevon, Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning, Operations Research, vol.39, issue.3, pp.378-406, 1991.
DOI : 10.1287/opre.39.3.378

B. Bollobás and A. Thomason, Random graphs of small order, Annals of Discrete Mathematics, vol.28, pp.251-256, 1985.

H. Hoos and T. Sttzle, Stochastic Local Search, 2004.
DOI : 10.1201/9781420010749.ch19

M. Chams, A. Hertz, and D. De-werra, Some experiments with simulated annealing for coloring graphs, Third EURO Summer Institute Special Issue Decision Making in an Uncertain World, pp.260-266, 1987.
DOI : 10.1016/S0377-2217(87)80148-0

I. Blöchliger and N. Zufferey, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Computers & Operations Research, vol.35, issue.3, pp.960-975, 2008.
DOI : 10.1016/j.cor.2006.05.014

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

N. Mladenovic and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2
URL : https://hal.archives-ouvertes.fr/hal-00979295

A. Hertz, M. Plumettaz, and N. Zufferey, Variable space search for graph coloring, Discrete Applied Mathematics, vol.156, issue.13, pp.2551-2560, 2002.
DOI : 10.1016/j.dam.2008.03.022

N. Mladenovi´cmladenovi´c, F. Plastria, and D. Uro?evi´uro?evi´c, Formulation space search for circle packing problems, Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics

M. Chiarandini and T. Stuetzle, An application of iterated local search to graph coloring, Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp.112-125, 2002.

I. Devarenne, A. Caminada, and H. Mabed, Analysis of adaptive local search for graph coloring problem, In: MIC2005, pp.1-1204, 1204.

D. , M. Abdallah, R. Caminada, and A. , Tabu?NG : Une approche de résolution hybride pour la coloration de graphes, p.2011, 2011.

C. Morgenstern, Distributed coloration neighborhood search In: Second DIMACS Implementation Challenge, DIMACS series in Discrete Mathematics and Theoretical Computer Science, pp.335-357, 1996.

J. H. Holland, Adaptation in natural and artificial systems, 1992.

D. Ashlock, Evolutionary Computation for Modeling and Optimization, 2004.

L. Davis, Order-based genetic algorithms and the graph coloring problem In: Handbook of Genetic Algorithms, pp.72-90, 1991.

C. A. Glass and A. Prügel-bennett, Genetic algorithm for graph colouring: Exploration of galinier and hao's algorithm, Journal of Combinatorial Optimization, vol.7, issue.3, pp.229-236, 2003.
DOI : 10.1023/A:1027312403532

P. Galinier, A. Hertz, and N. Zufferey, An adaptive memory algorithm for the k-coloring problem, Discrete Applied Mathematics, vol.156, issue.2, pp.267-279, 2008.
DOI : 10.1016/j.dam.2006.07.017

Y. Rochat and E. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics, vol.41, issue.1, 1995.
DOI : 10.1007/BF02430370

E. Malaguti, M. Monaci, and P. Toth, A Metaheuristic Approach for the Vertex Coloring Problem, INFORMS Journal on Computing, vol.20, issue.2, pp.302-316, 2008.
DOI : 10.1287/ijoc.1070.0245

A. Caprara, M. Fischetti, and P. Toth, A Heuristic Method for the Set Covering Problem, Operations Research, vol.47, issue.5, pp.47-730, 1999.
DOI : 10.1287/opre.47.5.730

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

J. R. Brown, Chromatic Scheduling and the Chromatic Number Problem, Management Science, vol.19, issue.4-part-1, pp.456-463, 1972.
DOI : 10.1287/mnsc.19.4.456

E. Sewell, An improved algorithm for exact graph coloring, In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.359-373, 1996.

J. Peemöller, A correction to Brelaz's modification of Brown's coloring algorithm, Communications of the ACM, vol.26, issue.8, pp.595-597, 1983.
DOI : 10.1145/358161.358171

P. Hansen, M. Labbé, and D. Schindl, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Discrete Optimization, vol.6, issue.2, pp.135-147, 2009.
DOI : 10.1016/j.disopt.2008.10.004
URL : https://hal.archives-ouvertes.fr/hal-01255547

F. Herrmann and A. Hertz, Finding the chromatic number by means of critical graphs, Journal of Experimental Algorithmics, vol.7, p.10, 2002.
DOI : 10.1145/944618.944628

S. Gualandi and F. Malucelli, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, INFORMS Journal on Computing, vol.24, issue.1, 2011.
DOI : 10.1287/ijoc.1100.0436