, 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
, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Information Sciences, vol.466, pp.203-219, 2018.
, 25 2.2 The classes matching procedure by a complete bipartite graph H, Proceedings of the Genetic and Evolutionary Computation Conference, pp.369-376, 2017.
URL : https://hal.archives-ouvertes.fr/ineris-01863245
, , p.30
, Influence of the increment/decrement value of the penalty efficient, p.66
, Flow chart of the iterated backtrack-based removal algorithm for finding k-VCS in a graph
, 33 2.2 Comparative results of RMA with state-of-the-art algorithms MACOL and PLSCOL on 19 easy benchmark instances, p.35
, Comparative results of RMA with state-of-the-art algorithms MACOL and PLSCOL on 20 difficult benchmark instances. The best results are in bold, p.36
, Assessment of different number of the parents. The better results are in bold, p.37
, Assessment of different strategies. The better results are in bold, p.38
, Analysis of the influence of the perturbation on the performance of the RMA algorithm. The better results are in bold
, Comparative results of FISA with state-of-the-art algorithms on the 73 benchmark instances
, Comparative results of the FISA algorithm with 3 different values of ? on the 26 instances. The best results are in bold
, Analysis of the influence of the perturbation on the performance of the FISA algorithm
, Settings of important parameters, p.61
, Comparative results of AFISA with state-of-the-art algorithms on the 46 DIMACS benchmark instances. Improved upper bounds are indicated in bold, p.62
, Comparative results of AFISA with state-of-the-art algorithms on the 35 pxx benchmark instances. Improved upper bounds are indicated in bold, p.63
, Comparative results of AFISA with state-of-the-art algorithms on the 30 rxx benchmark instances. Improved upper bounds are indicated in bold, p.64
, Comparative results of FISA with CPLEX on the additional set of 50 larger DI-MACS/COLOR instances. Improved upper bounds are indicated in bold, p.64
, Assessment of searching both feasible and infeasible solutions
, Assessment of the perturbation strategy. The better results are in bold, p.68
, Comparative results of IBR with state-of-the-art algorithm on the first category of instances
, 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
, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, Discrete Applied Mathematics, vol.164, p.16, 2014.
, Two novel evolutionary formulations of the graph coloring problem, Journal of Combinatorial Optimization, vol.8, issue.1, p.13, 2004.
, Designing and reporting on computational experiments with heuristic methods, Journal of heuristics, vol.1, issue.1, p.62, 1995.
, A multilevel memetic approach for improving graph k-partitions, IEEE Transactions on Evolutionary Computation, vol.15, issue.5, p.39, 2011.
, Breakout local search for maximum clique problems, Computers & Operations Research, vol.40, issue.1, p.59, 2013.
, The clique-partitioning problem, Computers & Mathematics with Applications, vol.22, issue.6, pp.1-11, 1991.
, Scheduling computer and manufacturing processes, Journal of the Operational Research Society, vol.48, issue.6, p.15, 1997.
, Scheduling computer and manufacturing processes, 2013.
, 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.
, Equitable colorings of bounded treewidth graphs, International Symposium on Mathematical Foundations of Computer Science, p.15, 2004.
, Noureddine Bouhmala and Ole-Christoffer Granmo. Solving graph coloring problems using learning automata, European Conference on Evolutionary Computation in Combinatorial Optimization, p.14, 2008.
, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, p.33, 1979.
, 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.
, A supernodal formulation of vertex colouring with applications in course timetabling, Annals of Operations Research, vol.179, issue.1, p.13, 2010.
, On the asymmetric representatives formulation for the vertex coloring problem, Discrete Applied Mathematics, vol.156, issue.7, pp.1097-1111, 2008.
, 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.
, A heuristic method for the set covering problem, Operations Research, vol.47, issue.5, p.18, 1999.
, 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.
, Register allocation & spilling via graph coloring, ACM Sigplan Notices, vol.17, p.12, 1982.
, Some results concerning post-infeasibility analysis, European Journal of Operational Research, vol.73, issue.1, pp.139-143, 1994.
, 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
, Equitable coloring and the maximum degree, European Journal of Combinatorics, vol.15, issue.5, p.15, 1994.
, 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
, 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
, Locating minimal infeasible constraint sets in linear programs, ORSA Journal on Computing, vol.3, issue.2, p.72, 1991.
, Minos (iis): infeasibility analysis using minos, Computers & Operations Research, vol.21, issue.1, pp.1-9, 1994.
, Feasibility and viability, Advances in Sensitivity Analysis and Parametic Programming, pp.491-531, 1997.
, Finding a useful subset of constraints for analysis in an infeasible linear program, INFORMS Journal on Computing, vol.9, issue.2, p.72, 1997.
, 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.
, 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
, Dominique de Werra. An introduction to timetabling, European journal of operational research, vol.19, issue.2, p.12, 1985.
, Christian Desrosiers, Philippe Galinier, and Alain Hertz. Efficient algorithms for finding critical subgraphs, Discrete Applied Mathematics, vol.156, issue.2, p.85, 2008.
, 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.
, Isabel Méndez Diaza, Graciela Nasinib, and Daniel Sever?nb. A polyhedral approach for the graph equitable coloring problem, p.15, 2008.
, An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem, Applied Soft Computing, vol.30, p.15, 2015.
, A new genetic local search algorithm for graph coloring, International Conference on Parallel Problem Solving from Nature, p.31, 1998.
, A university timetabling system based on graph colouring and constraint manipulation, Principles and Practice of Constraint Programming-CP 2003, vol.26, p.20, 1994.
, A grouping hyper-heuristic framework: Application on graph colouring, Expert Systems with Applications, vol.42, issue.13, p.26, 1996.
, Hanna Furmá nczyk and Marek Kubale. The complexity of equitable vertex coloring of graphs, Journal of combinatorial optimization, vol.9, issue.2, p.76, 1999.
, An adaptive memory algorithm for the k-colouring problem, Philippe Galinier, Alain Hertz, and Nicolas Zufferey, vol.33, pp.312-326, 2004.
, An adaptive memory algorithm for the k-coloring problem, Philippe Galinier, Alain Hertz, and Nicolas Zufferey, vol.156, p.35, 2008.
, Philippe Galinier, Zied Boujbel, and Michael Coutinho Fernandes. An efficient memetic algorithm for the graph partitioning problem, Annals of Operations Research, vol.191, issue.1, p.39, 2011.
, Recent advances in graph vertex coloring, Handbook of optimization, vol.23, p.43, 2013.
, Some lower bounds for a class of frequency assignment problems, IEEE transactions on vehicular technology, vol.35, issue.1, p.12, 1986.
, Graph partitioning and set covering for the optimal design of a production system in the metal industry, IFAC Proceedings Volumes, vol.58, p.18, 1979.
, The case for strategic oscillation, Annals of Operations Research, vol.183, issue.1, p.90, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01389281
, Tabu search, Handbook of Combinatorial Optimization, p.45, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02309983
, Coloring by tabu branch and bound, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, p.25, 1996.
, Diversification-driven tabu search for unconstrained binary quadratic problems, vol.4, p.78, 2010.
, Tabu search-part i, ORSA Journal on computing, vol.1, issue.3, p.57, 1989.
, Tabu search-part ii, ORSA Journal on computing, vol.2, issue.1, p.57, 1990.
, Partition-distance: A problem and class of perfect graphs arising in clustering, ISAIM, 2018. 13, vol.82, p.32, 2002.
, Frequency assignment: Theory and applications, Proceedings of the IEEE, vol.68, p.12, 1980.
, An adaptive algorithm for constrained optimization problems, International Conference on Parallel Problem Solving from Nature, p.58, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00001273
, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Discrete Optimization, vol.6, issue.2, p.13, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01255547
, Improving the extraction and expansion method for large graph coloring, Handbook of memetic algorithms, vol.160, pp.73-94, 2012.
, Alain Hertz and Dominique de Werra. Using tabu search techniques for graph coloring, Journal of Experimental Algorithmics, vol.7, issue.10, p.76, 1987.
, Yet another breakout inspired infeasible subset detection in constraint satisfaction problem, Proceedings on the International Conference on Artificial Intelligence (ICAI), page 1. The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), vol.156, p.19, 1997.
, Sandy Irani and Vitus Leung. Scheduling with conflicts, and applications to traffic signal control, SODA, vol.96, p.15, 1996.
, Hybrid evolutionary search for the minimum sum coloring problem of graphs, Information Sciences, vol.352, p.57, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01412530
, Kitagawa and Ikeda, 1988 ] Fumio Kitagawa and Hideto Ikeda. An existential problem of a weightcontrolled subset and its application to school timetable construction, Annals of Discrete Mathematics, vol.37, p.15, 1988.
, On equitable ?-coloring of graphs with low average degree, Equitable colorings of outerplanar graphs, vol.349, p.15, 2002.
, The hungarian method for the assignment problem. Naval Research Logistics (NRL), vol.2, p.29, 1955.
, Backtracking based iterated tabu search for equitable coloring, Engineering Applications of Artificial Intelligence, vol.46, p.89, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01412610
, A two-phase tabuevolutionary algorithm for the 0-1 multidimensional knapsack problem, Information Sciences, vol.436, p.19, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01707162
, On a binary-encoded ilp coloring formulation, INFORMS Journal on Computing, vol.19, issue.3, p.12, 2007.
, Frank Thomson Leighton. A graph coloring algorithm for large scheduling problems, Journal of research of the national bureau of standards, vol.6, p.13, 1979.
, Diversification and determinism in local search for satisfiability, Theory and Applications of Satisfiability Testing, pp.158-172, 2005.
, On finding all minimally unsatisfiable subformulas, International Conference on Theory and Applications of Satisfiability Testing, pp.173-186, 2005.
, On equitable coloring of bipartite graphs, Discrete Mathematics, vol.151, issue.1-3, p.15, 1996.
, Approximating the chromatic polynomial of a graph, International Workshop on Graph-Theoretic Concepts in Computer Science, pp.200-210, 1993.
, A rough penalty genetic algorithm for constrained optimization, formation Sciences, vol.241, p.19, 2013.
, A critical element-guided perturbation strategy for iterated local search, Evolutionary Computation in Combinatorial Optimization, p.78, 2009.
, A memetic algorithm for graph coloring, European Journal of Operational Research, vol.203, issue.1, p.35, 2010.
, An exact method for graph coloring, Computers & operations research, vol.33, issue.8, pp.2189-2207, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00783637
, Modified cuckoo optimization algorithm (mcoa) to solve graph coloring problem, Applied soft computing, vol.33, p.14, 2015.
, A survey on vertex coloring problems. International transactions in operational research, vol.17, p.57, 2010.
, A metaheuristic approach for the vertex coloring problem, INFORMS Journal on Computing, vol.20, issue.2, p.35, 2008.
, Models and heuristic algorithms for a weighted vertex coloring problem, Journal of Heuristics, vol.15, issue.5, p.93, 2009.
, An exact approach for the vertex coloring problem. Discrete Optimization, vol.8, p.14, 2011.
, Enrico Malaguti. The vertex coloring problem and its generalizations, p.18, 2009.
, No Free Lunch et recherche de solutions structurantes en coloration, p.13, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00607481
, Randomized heuristics for the capacitated clustering problem, Information Sciences, vol.417, p.60, 2017.
, Anuj Mehrotra and Michael A. Trick. A column generation approach for graph coloring, informs Journal on Computing, vol.8, issue.4, p.13, 1996.
, Isabel Méndez-Díaz and Paula Zabala. A branch-and-cut algorithm for graph coloring, Discrete Applied Mathematics, vol.154, issue.5, p.13, 2006.
, Isabel Méndez-Díaz and Paula Zabala. A cutting plane algorithm for graph coloring, Discrete Applied Mathematics, vol.156, issue.2, p.13, 2008.
, Isabel Méndez-Díaz, Graciela Nasini, and Daniel Severín. A polyhedral approach for the equitable coloring problem, Discrete Applied Mathematics, vol.164, p.49, 2014.
, A dsaturbased algorithm for the equitable coloring problem, Computers & Operations Research, vol.57, p.49, 2015.
, Equitable coloring, The American Mathematical Monthly, vol.80, issue.8, p.15, 1973.
, Moalic and Gondran, 2015 ] Laurent Moalic and Alexandre Gondran. The new memetic algorithm head for graph coloring: An easy way for managing diversity, International Conference on Theory and Applications of Satisfiability Testing, vol.4, p.35, 1979.
, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Proceedings of the 41st annual Design Automation Conference, vol.26, p.35, 1996.
, Reactive grasp: An application to a matrix decomposition problem in tdma traffic assignment, INFORMS Journal on Computing, vol.12, issue.3, p.65, 2000.
, Coloring a graph using split decomposition, International Workshop on Graph-Theoretic Concepts in Computer Science, vol.4, pp.52-71, 1968.
, An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment, European Journal of Operational Research, vol.41, issue.2, pp.1724-1733, 1989.
, 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.
, Some combinatorial optimization problems in graphs with applications in telecommunications and tomography, p.12, 2004.
, 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
, On feasible and infeasible search for equitable graph coloring, Proceedings of the Genetic and Evolutionary Computation Conference, vol.57, p.60, 2017.
, Iterated backtrack removal search for finding k-vertex-critical subgraphs, Journal of Heuristics, p.71, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01666820
, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Information Sciences, vol.466, p.53, 2018.
, Detecting iis in infeasible linear programmes using techniques from goal programming, Computers & Operations Research, vol.23, issue.2, pp.113-119, 1996.
, Quantum annealing of the graph coloring problem. Discrete Optimization, vol.8, p.35, 2011.
, Olawale Titiloye and Alan Crispin. Parameter tuning patterns for random graph coloring with quantum annealing, PloS one, vol.7, issue.11, p.35, 2012.
, Perfect graphs and an application to optimizing municipal services, Siam Review, vol.15, issue.3, p.15, 1973.
, Irreducibly inconsistent systems of linear inequalities, European Journal of Operational Research, vol.8, issue.3, pp.283-288, 1981.
, Multilevel refinement for combinatorial optimisation problems, Annals of Operations Research, vol.131, issue.1-4, pp.325-372, 2004.
, Tabu search with feasible and infeasible searches for equitable coloring, Engineering Applications of Artificial Intelligence, vol.71, p.60, 2018.
, Representations of the all_different predicate of constraint satisfaction in integer programming, INFORMS Journal on Computing, vol.13, issue.2, p.13, 2001.
, A hybrid metaheuristic method for the maximum diversity problem, European Journal of Operational Research, vol.231, issue.2, pp.452-464, 2013.
, Equitable coloring of kronecker products of complete multipartite graphs and complete graphs, Discrete Applied Mathematics, vol.162, p.15, 2014.
, Extracting small unsatisfiable cores from unsatisfiable boolean formula, Computers & Operations Research, vol.3, p.83, 2003.
, 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
, Graph colouring approaches for a satellite range scheduling problem, Journal of Scheduling, vol.11, issue.4, p.12, 2008.