Advertisement

Constraints

, Volume 19, Issue 4, pp 404–433 | Cite as

Graph coloring inequalities from all-different systems

  • David Bergman
  • J. N. Hooker
Article

Abstract

We explore the idea of obtaining valid inequalities for a 0–1 model from a finite-domain constraint programming formulation of the problem. In particular, we formulate a graph coloring problem as a system of all-different constraints. By analyzing the polyhedral structure of all-different systems, we obtain facet-defining inequalities that can be mapped to valid cuts in the classical 0–1 model of the problem. We focus on cuts corresponding to cycles and webs and show that they are stronger than known cuts for these structures. We also identify path cuts and show they do not strengthen the bound. Computational experiments for a set of benchmark instances reveal that finite-domain cycle cuts often deliver tighter bounds, in less time, than classical 0–1 cuts.

Keywords

Graph coloring Finite-domain variables Facet-defining inequalities 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Appa, G., Magos, D., Mourtos, I. (2004). Linear programming relaxations of multiple all-different predicates. In J. C. Régin, M. Rueher (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2004). Lecture notes in computer science (Vol. 3011, pp. 364–369). Springer.Google Scholar
  2. 2.
    Appa, G., Magos, D., Mourtos, I. (2004). On the system of two all-different predicates. Information Processing Letters, 94, 99–105.CrossRefMathSciNetGoogle Scholar
  3. 3.
    Bergman, D., & Hooker, J.N. (2012). Graph coloring facets from all-different systems. In N. Jussien, T. Petit (Eds.), Proceedings of the international workshop on integration of artificial intelligence and operations research techniques in constraint programming for combintaorial optimization problems. CPAIOR: Springer (to appear).Google Scholar
  4. 4.
    Coll, P., Marenco, J., Méndez-Díaz, I., Zabala, P. (2002). Facets of the graph coloring polytope. Annals of Operations Research, 116, 79–90.CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Genç-Kaya, L., & Hooker, J.N. (2010). The circuit polytope. Manuscript, Carnegie Mellon University.Google Scholar
  6. 6.
    Ghouila-Houri, A. (1962). Caractérisation des matrices totalement unimodulaires. Comptes rendus de l’Académie des Sciences de Paris, 254, 1192–1194.zbMATHMathSciNetGoogle Scholar
  7. 7.
    Hooker, J.N. (2000). Logic-based methods for optimization: combining optimization and constraint satisfaction. New York: Wiley.Google Scholar
  8. 8.
    Hooker, J.N. (2012). Integrated methods for optimization, 2nd edn. Springer.Google Scholar
  9. 9.
    Kruk, S., & Toma, S. (2009). On the system of the multiple all different predicates. Congressus Numerantium, 197, 47–64.zbMATHMathSciNetGoogle Scholar
  10. 10.
    Kruk, S., & Toma, S. (2010). On the facets of the multiple alldifferent constraint. Congressus Numerantium, 204, 5–32.zbMATHMathSciNetGoogle Scholar
  11. 11.
    Magos, D., & Mourtos, I. (2011). On the facial structure of the alldifferent system. SIAM Journal on Discrete Mathematics, 25(1), 130–158.CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Magos, D., Mourtos, I., Appa, G. (2012). A polyhedral approach to the alldifferent system. Mathematical Programming, 132, 209–260.CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Méndez-Díaz, I., & Zabala, P. (2001). A polyhedral approach for graph coloring. Electronic Notes in Discrete Mathematics, 7, 178–181.CrossRefGoogle Scholar
  14. 14.
    Méndez-Díaz, I., & Zabala, P. (2008). A cutting plane algorithm for graph coloring. Discrete Applied Mathematics, 156, 159–179.CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Nemhauser, G.L., & Wolsey, L.A. (1999). Integer and combinatorial optimization. New York: Wiley.Google Scholar
  16. 16.
    Palubeckis, G. (2008). On the graph coloring polytope. Information Technology and Control, 37, 7–11.Google Scholar
  17. 17.
    Williams, H.P., & Yan, H. (2001). Representations of the all different predicate of constraint satisfaction in integer programming. INFORMS Journal on Computing, 13, 96–103.CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Yan, H., & Hooker, J.N. (1995). Tight representations of logical constraints as cardinality rules. Mathematical Programming, 85, 363–377.CrossRefMathSciNetGoogle Scholar
  19. 19.
    Yunes, T.H. (2002). On the sum constraint: relaxation and applications. In P. Van Hentenryck (Ed.), Principles and practice of constraint programming (CP 2002). Lecture notes in computer science (Vol. 2470, pp. 80–92). Springer.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.School of BusinessUniversity of ConnecticutStamfordUSA
  2. 2.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations