W. Sun, J. Hao, and A. Caminada, Iterated backtrack removal search for finding k-vertex-critical subgraphs, Journal of Heuristics, pp.1-26, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01666820

W. Sun, J. Hao, X. Lai, and Q. Wu, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Information Sciences, vol.466, pp.203-219, 2018.

, Comparative results of IBR with state-of-the-art algorithm on the second category of instances

, Comparative results of IBR with state-of-the-art algorithm on the third category of instances. Improved results are indicated in bold

, Comparative results of IBR with state-of-the-art algorithm on the fourth category of instances. Improved results are indicated in bold

, Comparative results of the IBR algorithm with two different backtrack strategies. Improved results are indicated in bold

, Analysis of the influence of the perturbation on the performance of the IBR algorithm. The BR algorithm is obtained by replacing the perturbation procedure of the IBR algorithm with a restart strategy. Improved results are indicated in bold, p.86

, IR is obtained by disabling the backtracking procedure, vol.87

[. References and . Bahiense, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, Discrete Applied Mathematics, vol.164, p.16, 2014.

[. Barbosa, Two novel evolutionary formulations of the graph coloring problem, Journal of Combinatorial Optimization, vol.8, issue.1, p.13, 2004.

[. Barr, Designing and reporting on computational experiments with heuristic methods, Journal of heuristics, vol.1, issue.1, p.62, 1995.

H. Benlic, J. Benlic, and . Hao, A multilevel memetic approach for improving graph k-partitions, IEEE Transactions on Evolutionary Computation, vol.15, issue.5, p.39, 2011.

H. Benlic, J. Benlic, and . Hao, Breakout local search for maximum clique problems, Computers & Operations Research, vol.40, issue.1, p.59, 2013.

S. Bhasker, T. Bhasker, and . Samad, The clique-partitioning problem, Computers & Mathematics with Applications, vol.22, issue.6, pp.1-11, 1991.

[. Blazewicz, Scheduling computer and manufacturing processes, Journal of the Operational Research Society, vol.48, issue.6, p.15, 1997.

[. Blazewicz, Scheduling computer and manufacturing processes, 2013.

Z. Blöchliger, Ivo Blöchliger and Nicolas Zufferey. A graph coloring heuristic using partial solutions and a reactive tabu scheme, Computers & Operations Research, vol.35, issue.3, p.35, 2008.

L. Hans, F. V. Bodlaender, and . Fomin, Equitable colorings of bounded treewidth graphs, International Symposium on Mathematical Foundations of Computer Science, p.15, 2004.

G. Bouhmala, Noureddine Bouhmala and Ole-Christoffer Granmo. Solving graph coloring problems using learning automata, European Conference on Evolutionary Computation in Combinatorial Optimization, p.14, 2008.

D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, p.33, 1979.

[. Burke, A genetic algorithm based university timetabling system, Proceedings of the 2nd east-west international conference on computer technologies in education, vol.1, p.12, 1994.

[. Burke, A supernodal formulation of vertex colouring with applications in course timetabling, Annals of Operations Research, vol.179, issue.1, p.13, 2010.

[. Campêlo, On the asymmetric representatives formulation for the vertex coloring problem, Discrete Applied Mathematics, vol.156, issue.7, pp.1097-1111, 2008.

[. Campêlo, Um algoritmo de planos-de-corte para o número cromático fracionário de um grafo, Pesquisa Operacional, vol.29, issue.1, pp.179-193, 2009.

[. Caprara, A heuristic method for the set covering problem, Operations Research, vol.47, issue.5, p.18, 1999.

[. Caramia and D. Olmo, Massimiliano Caramia and Paolo Dell Olmo. Coloring graphs by iterated local search traversing feasible and infeasible solutions, Discrete Applied Mathematics, vol.156, issue.2, p.35, 2008.

G. J. Chaitin, Register allocation & spilling via graph coloring, ACM Sigplan Notices, vol.17, p.12, 1982.

N. Chakravarti, Some results concerning post-infeasibility analysis, European Journal of Operational Research, vol.73, issue.1, pp.139-143, 1994.

;. Hao, J. Chen, and . Hao, Memetic search for the generalized quadratic multiple knapsack problem, IEEE Transactions on Evolutionary Computation, vol.20, issue.6, p.39, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01412542

[. Chen, Equitable coloring and the maximum degree, European Journal of Combinatorics, vol.15, issue.5, p.15, 1994.

[. Chen, An evolutionary path relinking approach for the quadratic multiple knapsack problem. Knowledge-Based Systems, vol.92, p.52, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01412540

[. Chen, A hybrid metaheuristic approach for the capacitated arc routing problem, European Journal of Operational Research, vol.253, issue.1, p.90, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01412524

J. W. Chinneck and E. W. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA Journal on Computing, vol.3, issue.2, p.72, 1991.

J. W. Chinneck, Minos (iis): infeasibility analysis using minos, Computers & Operations Research, vol.21, issue.1, pp.1-9, 1994.

J. W. Chinneck and . Chinneck, Feasibility and viability, Advances in Sensitivity Analysis and Parametic Programming, pp.491-531, 1997.

J. W. Chinneck and . Chinneck, Finding a useful subset of constraints for analysis in an infeasible linear program, INFORMS Journal on Computing, vol.9, issue.2, p.72, 1997.

[. Coll, Isabel Méndez Díaz, and Paula Zabala. Facets of the graph coloring polytope, Annals of Operations Research, vol.116, issue.1-4, p.13, 2002.

[. Cornaz, Solving vertex coloring problems as maximum weight stable set problems, Discrete Applied Mathematics, vol.217, p.63, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01492044

. De-werra, Dominique de Werra. An introduction to timetabling, European journal of operational research, vol.19, issue.2, p.12, 1985.

. Desrosiers, Christian Desrosiers, Philippe Galinier, and Alain Hertz. Efficient algorithms for finding critical subgraphs, Discrete Applied Mathematics, vol.156, issue.2, p.85, 2008.

. Desrosiers, Isabel Méndez Díaz, Graciela Nasini, and Daniel Severín. A tabu search heuristic for the equitable coloring problem, International Symposium on Combinatorial Optimization, vol.18, p.48, 2009.

[. Diaza, Isabel Méndez Diaza, Graciela Nasinib, and Daniel Sever?nb. A polyhedral approach for the graph equitable coloring problem, p.15, 2008.

;. D. Schaerf and . Schaerf, Multi neighborhood local search with application to the course timetabling problem, Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling, 2003.

D. Schindl and . Schindl, Some combinatorial optimization problems in graphs with applications in telecommunications and tomography, p.12, 2004.

[. Sghir, A multi-agent based optimization method applied to the quadratic assignment problem, Expert Systems with Applications, vol.42, issue.23, p.14, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01412941

. Sun, On feasible and infeasible search for equitable graph coloring, Proceedings of the Genetic and Evolutionary Computation Conference, vol.57, p.60, 2017.

. Sun, Iterated backtrack removal search for finding k-vertex-critical subgraphs, Journal of Heuristics, p.71, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01666820

. Sun, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Information Sciences, vol.466, p.53, 2018.

[. Tamiz, Detecting iis in infeasible linear programmes using techniques from goal programming, Computers & Operations Research, vol.23, issue.2, pp.113-119, 1996.

C. Titiloye, Quantum annealing of the graph coloring problem. Discrete Optimization, vol.8, p.35, 2011.

C. Titiloye, Olawale Titiloye and Alan Crispin. Parameter tuning patterns for random graph coloring with quantum annealing, PloS one, vol.7, issue.11, p.35, 2012.

A. Tucker, Perfect graphs and an application to optimizing municipal services, Siam Review, vol.15, issue.3, p.15, 1973.

[. Van-loon and ;. J. Van-loon, Irreducibly inconsistent systems of linear inequalities, European Journal of Operational Research, vol.8, issue.3, pp.283-288, 1981.

C. Walshaw and . Walshaw, Multilevel refinement for combinatorial optimisation problems, Annals of Operations Research, vol.131, issue.1-4, pp.325-372, 2004.

[. Wang, Tabu search with feasible and infeasible searches for equitable coloring, Engineering Applications of Artificial Intelligence, vol.71, p.60, 2018.

Y. Williams, H. Williams, and . Yan, Representations of the all_different predicate of constraint satisfaction in integer programming, INFORMS Journal on Computing, vol.13, issue.2, p.13, 2001.

H. Wu, J. Wu, and . Hao, A hybrid metaheuristic method for the maximum diversity problem, European Journal of Operational Research, vol.231, issue.2, pp.452-464, 2013.

Y. , W. Yan, and W. Wang, Equitable coloring of kronecker products of complete multipartite graphs and complete graphs, Discrete Applied Mathematics, vol.162, p.15, 2014.

M. Zhang, S. Zhang, ;. Malik, and . Zhou, Extracting small unsatisfiable cores from unsatisfiable boolean formula, Computers & Operations Research, vol.3, p.83, 2003.

[. Zhou, Improving probability learning based local search for graph coloring, Applied Soft Computing, vol.65, p.35, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01707180

[. Zufferey, Graph colouring approaches for a satellite range scheduling problem, Journal of Scheduling, vol.11, issue.4, p.12, 2008.