Exact solution of graph coloring problems via constraint programming and column generation

INFORMS Journal on Computing

Volumn 24, Issue 1, 2012, Pages 81-100

  Gualandi, Stefano ^a   Malucelli, Federico ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Column generation; Constraint programming; Graph coloring; Integer linear programming

Indexed keywords

ADJACENT VERTICES; BOUNDING METHOD; BRANCH-AND-PRICE ALGORITHMS; COLUMN GENERATION; COLUMN GENERATION APPROACH; COMPUTATIONAL RESULTS; CONSTRAINT PROGRAMMING; EXACT SOLUTION; GRAPH COLORING PROBLEM; GRAPH COLORINGS; HEURISTIC SOLUTIONS; INTEGER LINEAR PROGRAMMING; LINEAR RELAXATIONS; LOWER BOUNDS; OPTIMALITY; SOLUTION APPROACH; VERTEX COLORING; VERTEX COLORING PROBLEMS; VERTEX GRAPHS;

COLOR; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

GRAPH THEORY;

EID: 84862018477     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0436     Document Type: Article

References (53)

1. Apt, K. R. 2003. Principles of Constraint Programming. Cambridge University Press, Cambridge, UK.
2. Barnier, N., P. Brisset. 2004. Graph coloring for air traffic flow management. Ann. Oper. Res. 130 (1-4) 163-178. (Pubitemid 38919318)
3. Brélaz, D. 1979. New methods to color the vertices of a graph. Comm. ACM 22 (4) 251-256. (Pubitemid 9452014)
4. Busygin, S. 2006. A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 154 2080-2096. (Pubitemid 44188926)
5. Capone, A., G. Carello, I. Filippini, S. Gualandi, F. Malucelli. 2010. Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation. Networks 55 (3) 221-233.
6. Coleman, T. F., J. J. Moré. 1984. Estimation of sparse Hessian matrices and graph coloring problems. Math. Programming 28 (3) 243-270.
7. Coll, P., J. Marenco, I. Méndez-Díaz, P. Zabala. 2002. Facets of the graph coloring polytope. Ann. Oper. Res. 116 (1-4) 79-90. (Pubitemid 37132195)
8. Demassey, S., G. Pesant, L.-M. Rousseau. 2006. A cost-regular based hybrid column generation approach. Constraints 11 (4) 315-333. (Pubitemid 44835823)
9. Easton, K., G. L. Nemhauser, M. A. Trick. 2002. Solving the travelling tournament problem: A combined integer programming and constraint programming approach. E. Burke, P. De Causmaecker, eds. Proc. Practice Theory Automated Timetabling. Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin, 100-112.
10. Fahle, T. 2002. Simple and fast: Improving a branch-and-bound algorithm for maximum clique. R. Möhring, R. Raman, eds. Proc. Ann. Eur. Symp. Algorithms. Lecture Notes in Computer Science, Vol. 2461. Springer, Berlin, 47-86.
11. Fahle, T., M. Sellmann. 2002. Cost based filtering for the constrained knapsack problem. Ann. Oper. Res. 115 (1-4) 73-93. (Pubitemid 37132209)
12. Fahle, T., U. Junker, S. E. Karisch, N. Kohl, M. Sellmann, B. Vaaben. 2002. Constraint programming based column generation for crew assignment. J. Heuristics 8 (1) 59-81. (Pubitemid 34172763)
13. Gabteni, S., M. Grönkvist. 2006. A hybrid column generation and constraint programming optimizer for the tail assignment problem. J. C. Beck, B. M. Smith, eds. Proc. Integration AI OR Techniques CP Combin. Optim. Lecture Notes in Computer Science, Vol. 3990. Springer, Berlin, 89-103. (Pubitemid 44071052)
14. Gendron, B., H. Lebbah, G. Pesant. 2005. Improving the cooperation between the master problem and the subproblem in constraint programming based column generation. R. Barták, M. Milano, eds. Proc. Integration AI OR Techniques CP Combin. Optim. Lecture Notes in Computer Science, Vol. 3524. Springer, Berlin, 217-227. (Pubitemid 41422289)
15. Gent, I. P., K. E. Petrie, J.-F. Puget. 2006. Symmetry in constraint programming. F. Rossi, P. Van Beeck, T. Walsh, eds. Handbook of Constraint Programming. Elsevier Science, Amsterdam, 329-376.
16. Gomes, C. P., B. Selman, H. Kautz. 1998. Boosting combinatorial search through randomization. Proc. AAAI, Madison, WI, John Wiley & Sons, New York, 431-437.
17. Grönkvist, M. 2004. A constraint programming model for tail assignment. J.-C. Régin, M. Rueher, eds. Proc. Integration AI OR Techniques CP Combin. Optim. Lecture Notes in Computer Science, Vol. 3011. Springer, Berlin, 142-156.
18. Grönkvist, M. 2006. Accelerating column generation for aircraft scheduling using constraint propagation. Comp. OR 33 2918-2934. (Pubitemid 43199832)
19. Gualandi, S. 2008. Enhancing constraint programming-based column generation for integer programs. Ph. D. thesis, Politecnico di Milano, Milano, Italy.
20. Gualandi, S., F. Malucelli. 2009a. A branching scheme for vertex coloring problems. Technical Report 2009-11-2450, Politecnico di Milano, Milano, Italy. http://www.optimization-online.org/DB-HTML/2009/11/2450.html.
21. Gualandi, S., F. Malucelli. 2009b. Constraint programming-based column generation. 4OR: Quart. J. Oper. Res. 7 (2) 113-137.
22. Gvozdenović, N., M. Laurent. 2008. Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization. SIAM J. Optim. 19 (2) 592-615.
23. Hansen, J., T. Liden. 2005. Group construction for airline cabin crew: Comparing constraint programming with branch and price. R. Barták, M. Milano, eds. Proc. Integration AI OR Techniques CP Combin. Optim. Lecture Notes in Computer Science, Vol. 3524. Springer, Berlin, 228-242. (Pubitemid 41422290)
24. Hansen, P., M. Labbé, D. Schindl. 2009. Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discrete Optim. 6 (2) 135-147.
25. Harvey, W. D., M. L. Ginsberg. 1995. Limited discrepancy search. C. S. Mellish, ed. Proc. Internat. Joint Conf. Artificial Intelligence, Morgan Kaufmann, San Francisco, 607-615.
26. Hertz, A., D. de Werra. 1987. Using tabu search techniques for graph coloring. Computing 39 (4) 345-351. (Pubitemid 18562739)
27. Junker, U., S. E. Karisch, N. Kohl, B. Vaaben, T. Fahle, M. Sellmann. 1999. A framework for constraint programming based column generation. J. Jaffar, ed. Proc. Principles Practice of Constraint Programming. Lecture Notes in Computer Science, Vol. 1713. Springer, Berlin, 261-274.
28. Leighton, F. T. 1979. A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bureau Standards 84 (6) 489-506.
29. Lübbecke, M. E., J. Desrosiers. 2005. Selected topics in column generation. Oper. Res. 53 (6) 1007-1023. (Pubitemid 43061815)
30. Malaguti, E., P. Toth. 2010. A survey on vertex coloring problems. Internat. Trans. Oper. Res. 17 (1) 1-34.
31. Mehrotra, A., M. A. Trick. 1996. A column generation approach for graph coloring. INFORMS J. Comput. 8 (4) 344-354.
32. Mehrotra, A., M. A. Trick. 2007. A branch-and-price approach for graph multi-coloring. Extending the Horizons: Advances in Computing, Optimization and Decision Technology. Springer, Berlin, 15-29.
33. Méndez-Díaz, I., P. Zabala. 2006. A branch-and-cut algorithm for graph coloring. Discrete Appl. Math. 154 (5) 826-847.
34. Méndez-Díaz, I., P. Zabala. 2008. A cutting plane algorithm for graph coloring. Discrete Appl. Math. 156 (2) 159-179. (Pubitemid 350251593)
35. Milano, M., M. Wallace. 2006. Integrating operations research in constraint programming. 4OR: Quart. J. Oper. Res. 4 (3) 175-219.
36. Östergård, P. R. J. 2002. A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120 (1-3) 197-207.
37. Otten, L., M. Grönkvist, D. P. Dubhashi. 2006. Randomization in constraint programming for airline planning. F. Benhamou, ed. Proc. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, Vol. 4204. Springer, Berlin, 406-420. (Pubitemid 44618754)
38. Pisinger, D., M. Sigurd. 2007. Using decomposition techniques and constraint programming for solving the two-dimensional binpacking problem. INFORMS J. Comput. 19 (1) 36-51.
39. Prestwich, S. 2008. Generalised graph colouring by a hybrid of local search and constraint programming. Discrete Appl. Math. 156 (2) 148-158. (Pubitemid 350251592)
40. Régin, J. C. 1994. A filtering algorithm for constraints of difference in CSPs. Proc. Natl. Conf. Artificial Intelligence, American Association for Artificial Intelligence, Menlo Park, CA, 362-362.
41. Rossi, F., P. Van Beek, T. Walsh, eds. 2006. Handbook of Constraint Programming. Elsevier Science, Amsterdam.
42. Rousseau, L. M. 2004. Stabilization issues for constraint programming based column generation. J.-C. Régin, M. Rueher, eds. Proc. Integration AI OR Techniques CP Combin. Optim. Lecture Notes in Computer Science, Vol. 3011. Springer, Berlin, 402-408.
43. Rousseau, L. M., M. Gendreau, G. Pesant, F. Focacci. 2004. Solving VRPTWs with constraint programming based column generation. Ann. Oper. Res. 130 199-216. (Pubitemid 38919320)
44. Ryan, D. M., B. A. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling. North-Holland, Amsterdam, 269-280.
45. Sadykov, R., L. A. Wolsey. 2006. Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. INFORMS J. Comput. 18 (2) 209-217. (Pubitemid 44000304)
46. Schrjiver, A. 2008. Combinatorial Optimization-Polyhedra and Efficiency. Springer, New York.
47. Schulte, C., M. Lagerkvist, G. Tack. 2009. Modeling and Programming with Gecode. User's manual, http://www.geocode.org.
48. Sellmann, M., K. Zervoudakis, P. Stamatopoulos, T. Fahle. 2002. Crew assignment via constraint programming: Integrating column generation and heuristic tree search. Ann. Oper. Res. 115 207-225. (Pubitemid 37132215)
49. Vanderbeck, F. 2011. Branching in branch-and-price: A generic scheme. Math. Programming Ser. A 130 (2) 249-294.
50. Vasquez, M. 2004. New results on the queens-n2 graph coloring problem. J. Heuristics 10 (4) 407-413.
51. Yunes, T. H., A. V. Moura, C. C. de Souza. 2000. Solving very large crew scheduling problems to optimality. Proc. ACM Symp. Appl. Comput., ACM, New York, 446-451.
52. Yunes, T. H., A. V. Moura, C. C. de Souza. 2005. Hybrid column generation approaches for urban transit crew management problems. Transportation Sci. 39 (2) 273-288. (Pubitemid 40748594)
53. Zykov, A. A. 1949. On some properties of linear complexes. Mat. Sbornik. 24 (66) 163-188.