Skip to main content
SpringerLink
Log in

Packing and partitioning orbitopes

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at most or exactly one 1-entry in each row, respectively. The goal of investigating these polytopes is to gain insight into ways of breaking certain symmetries in integer programs by adding constraints, e.g., for a well-known formulation of the graph coloring problem.

We provide a thorough polyhedral investigation of packing and partitioning orbitopes for the cases in which the group acting on the columns is the cyclic group or the symmetric group. Our main results are complete linear inequality descriptions of these polytopes by facet-defining inequalities. For the cyclic group case, the descriptions turn out to be totally unimodular, while for the symmetric group case, both the description and the proof are more involved. The associated separation problems can be solved in linear time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Borndörfer R., Ferreira C.E. and Martin A. (1998). Decomposing matrices into blocks. SIAM J. Optim. 9(1): 236–269

    Article  MATH  Google Scholar 

  2. Borndörfer, R., Grötschel, M., Pfetsch, M.E.: A column-generation approach for line planning in public transport. Transp. Sci. (in press)

  3. Campêlo M., Corrêa R. and Frota Y. (2004). Cliques, holes and the vertex coloring polytope. Inform. Process. Lett. 89(4): 159–164

    Article  MathSciNet  Google Scholar 

  4. Coll P., Marenco J., Méndez Díaz I. and Zabala P. (2002). Facets of the graph coloring polytope. Ann. Oper. Res. 116: 79–90

    Article  MATH  MathSciNet  Google Scholar 

  5. Cornaz, D.: On forests, stable sets and polyhedras associated with clique partitions. Preprint, 2006. Available at www.optimization-online.org

  6. Eisenblätter, A.: Frequency assignment in GSM networks: models, heuristics, and lower bounds. Ph.D. thesis, TU Berlin (2001)

  7. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) Principles and Practice of Constraint Programming—CP 2001: 7th International Conference, LNCS 2239, pp. 93–107. Springer, Berlin Heidelberg New York (2001)

  8. Figueiredo, R., Barbosa, V., Maculan, N., de Souza, C.: New 0-1 integer formulations of the graph coloring problem. In: Proceedings of XI CLAIO (2002)

  9. Garey M.R. and Johnson D.S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York

    MATH  Google Scholar 

  10. Grötschel M., Lovász L. and Schrijver A. (1993). Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics, vol. 2. Springer, Berlin Heidelberg New York

    Google Scholar 

  11. Margot F. (2002). Pruning by isomorphism in branch-and-cut. Math. Programm. 94(1): 71–90

    Article  MATH  MathSciNet  Google Scholar 

  12. Margot F. (2003). Small covering designs by branch-and-cut. Math. Programm. 94(2–3): 207–220

    Article  MATH  MathSciNet  Google Scholar 

  13. Mehrotra A. and Trick M.A. (1996). A column generation approach for graph coloring. Informs J. Comput. 8(4): 344–354

    Article  MATH  Google Scholar 

  14. Méndez-Díaz, I., Zabala, P.: A polyhedral approach for graph coloring. Electron. Notes Discrete Math. 7 (2001)

  15. Méndez-Díaz I. and Zabala P. (2006). A branch-and-cut algorithm for graph coloring. Discrete Appl. Math. 154(5): 826–847

    Article  MATH  MathSciNet  Google Scholar 

  16. Puget J.-F. (2005). Symmetry breaking revisited. Constraints 10(1): 23–46

    Article  MATH  MathSciNet  Google Scholar 

  17. Ramani, A., Aloul, F.A., Markov, I.L., Sakallah, K.A.: Breaking instance-independent symmetries in exact graph coloring. In: Design Automation and Test in Europe Conference, pp. 324–329 (2004)

  18. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986). Reprint, 1998

  19. Serafini P. and Ukovich W. (1989). A mathematical model for periodic scheduling problems. SIAM J. Discr. Math. 2(4): 550–581

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany

    Volker Kaibel & Marc Pfetsch

Authors
  1. Volker Kaibel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Pfetsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Volker Kaibel.

Additional information

Supported by the DFG Research Center Matheon in Berlin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaibel, V., Pfetsch, M. Packing and partitioning orbitopes. Math. Program. 114, 1–36 (2008). https://doi.org/10.1007/s10107-006-0081-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-006-0081-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation