Skip to main content

Symmetry Breaking Inequalities from the Schreier-Sims Table

  • Conference paper
  • First Online:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018)

Abstract

We propose a way to derive symmetry breaking inequalities for a mixed-integer programming (MIP) model from the Schreier-Sims table of its formulation group. We then show how to consider only the action of the formulation group onto a subset of the variables. Computational results show that this can lead to considerable speedups on some classes of models.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This is a much simplified version of the pigeon models [2] in MIPLIB 2010 [9].

References

  1. Achterberg, T.: Constraint integer programming. Ph.D thesis. Technische Universität Berlin (2007)

    Google Scholar 

  2. Allen, S.D., Burke, E.K., Marecek, J.: A space-indexed formulation of packing boxes into a larger box. Oper. Res. Lett. 40, 20–24 (2012)

    Article  MathSciNet  Google Scholar 

  3. Butler, G., Cannon, J.J.: Computing in permutation and matrix groups I: normal closure, commutator subgroups, series. Math. Comput. 39, 663–670 (1982)

    MathSciNet  MATH  Google Scholar 

  4. Cameron, P.J.: Permutation Groups. London Mathematical Society St. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

  5. Danna, E.: Performance variability in mixed integer programming. In: MIP 2008 Workshop in New Work (2008). http://coral.ie.lehigh.edu/~jeff/mip-2008/talks/danna.pdf

  6. Gent, I.P., Petrie, K.E., Puget, J.-F.: Symmetry in constraint programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 329–376. Elsevier (2006)

    Chapter  Google Scholar 

  7. IBM: ILOG CPLEX 12.7.1 User’s Manual (2017)

    Google Scholar 

  8. Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114, 1–36 (2008)

    Article  MathSciNet  Google Scholar 

  9. Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010 - mixed integer programming library version 5. Math. Program. Comput. 3, 103–163 (2011)

    Article  MathSciNet  Google Scholar 

  10. Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press, Boca Raton (1999)

    MATH  Google Scholar 

  11. Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131, 273–304 (2012)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. 98(1), 3–21 (2003)

    Article  MathSciNet  Google Scholar 

  14. Margot, F.: Symmetry in integer linear programming. In: Jünger, M., et al. (eds.) 50 Years of Integer Programming, pp. 647–686. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-68279-0_17

    Chapter  Google Scholar 

  15. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147–178 (2011)

    Article  MathSciNet  Google Scholar 

  16. Puget, J.-F.: Automatic detection of variable and value symmetries. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 475–489. Springer, Heidelberg (2005). https://doi.org/10.1007/11564751_36

    Chapter  Google Scholar 

  17. Puget, J.-F.: Breaking symmetries in all different problems. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 272–277 (2005)

    Google Scholar 

  18. Seress, Á.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  19. Sims, C.C.: Computational methods in the study of permutation groups. In: Computational problems in abstract algebra (Oxford 1967), pp. 169–183. Pergamon Press, Oxford (1970)

    Google Scholar 

Download references

Acknowledgements

The author would like to thank Jean-François Puget for an inspiring discussion about the Schreier-Sims table, and three anonymous reviewers for their careful reading and constructive comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Domenico Salvagnin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Salvagnin, D. (2018). Symmetry Breaking Inequalities from the Schreier-Sims Table. In: van Hoeve, WJ. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2018. Lecture Notes in Computer Science(), vol 10848. Springer, Cham. https://doi.org/10.1007/978-3-319-93031-2_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93031-2_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93030-5

  • Online ISBN: 978-3-319-93031-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics