Mathematical Programming

, Volume 98, Issue 1–3, pp 3–21 | Cite as

Exploiting orbits in symmetric ILP

  • François Margot


This paper describes components of a branch-and-cut algorithm for solving integer linear programs having a large symmetry group. It describes an isomorphism pruning algorithm and variable setting procedures using orbits of the symmetry group. Pruning and orbit computations are performed by backtracking procedures using a Schreier-Sims table for representing the symmetry group. Applications to hard set covering problems, generation of covering designs and error correcting codes are given.


Branch-and-cut Isomorphism pruning Symmetry 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Avis, D.: A Note on Some Computationally Difficult Set Covering Problems. Mathematical Programming 8, 138–145 (1980)Google Scholar
  2. 2.
    Butler, G.: Computing in Permutation and Matrix Groups II: Backtrack Algorithm. Mathematics of Computation 39, 671–680 (1982)Google Scholar
  3. 3.
    Butler, G.: Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer Science 559, Springer, 1991Google Scholar
  4. 4.
    Butler, G., Cannon, J.J.: Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series. Mathematics of Computation 39, 663–670 (1982)Google Scholar
  5. 5.
    Butler, G., Lam, W.H.: A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects. Journal of Symbolic Computation 1, 363–381 (1985)Google Scholar
  6. 6.
    Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Springer, 1993Google Scholar
  7. 7.
    Feo, T.A., Resende, G.C.: A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Operations Research Letters 8, 67–71 (1989)Google Scholar
  8. 8.
    Fulkerson, D.R., Nemhauser, G.L., Trotter, L.E.: Two Computationally difficult Set Covering Problems That Arise in Computing the 1-width of Incidence Matrices of Steiner Triple Systems. Mathematical Programming Study 2, 72–81 (1974)Google Scholar
  9. 9.
    Hall, M.: Combinatorial Theory. Wiley, 1986Google Scholar
  10. 10.
    Jünger, M., Naddef, D., eds.: Computational Combinatorial Optimization. Lecture Notes in Computer Science 2241, Springer, 2001Google Scholar
  11. 11.
    ILOG CPLEX 7.1 User's Manual, 2001Google Scholar
  12. 12.
    Elf, M., Gutwenger, C., Jünger, M., Rinaldi, G.: Branch-and-Cut Algorithms for Combinatorial Optimization and their Implementation in ABACUS. In: [10], 155–222Google Scholar
  13. 13.
    Etzion, T., Wei, V., Zhang, Z.: Bounds on the Sizes of Constant Weight Covering Codes. Designs, Codes and Cryptography 5, 217–239 (1995)Google Scholar
  14. 14.
    Hoffman, C.M.: Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer Science 136, Springer, 1982Google Scholar
  15. 15.
    Jünger, M., Thienel, S.: Introduction to ABACUS – A Branch-And-Cut System. Operations Research Letters 22, 83–95 (1998)Google Scholar
  16. 16.
    Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms, Generation, Enumeration, and Search, CRC Press, 1999Google Scholar
  17. 17.
    Leon, J.S.: On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations. Mathematics of Computation 35, 941–974 (1980)Google Scholar
  18. 18.
    Leon, J.S.: Computing Automorphism Groups of Combinatorial Objects. In: Computational Group Theory, Atkinson M.D. (ed.), Academic Press 1984, pp. 321–335Google Scholar
  19. 19.
    Luks, E.: Permutation Groups and Polynomial-Time Computation. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 11 1993, Groups and Computation, L. Finkelsein, W. Kantor, eds., 139–175Google Scholar
  20. 20.
    Mannino, C., Sassano, A.: Solving Hard Set Covering Problems. Operations Research Letters 18, 1–5 (1995)Google Scholar
  21. 21.∼fmargot/recpub.htmlGoogle Scholar
  22. 22.
    Margot, F.: Small Covering Designs by Branch-and-Cut. Research report 2000-27, Department of Mathematics, University of Kentucky. To appear in Mathematical Programming.Google Scholar
  23. 23.
    Margot, F.: Pruning by Isomorphism in Branch-and-Cut. Research report 2001-08, Department of Mathematics, University of Kentucky.Google Scholar
  24. 24.
    Lytsin, S.: An Updated Table of the Best Binary Codes Known. In: Handbook of Coding Theory, V.S. Pless, W.C. Huffmann, eds., North-Holland, Elsevier, 1998Google Scholar
  25. 25.
    Martin, A.: General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In: [10], 1–25Google Scholar
  26. 26.
    McKay, B.D.: Nauty User's Guide (Version 1.5). Computer Science Department, Australian National University, CanberraGoogle Scholar
  27. 27.
    Mills, W.H., Mullin, R.C.: Coverings and Packings. In: Contemporary Design Theory: A collection of Surveys. Dinitz J.H., Stinson D.R., eds., Wiley, 1992, 371–399Google Scholar
  28. 28.
    Odijk, M.A., van Maaren, H.: Improved Solutions to the Steiner Triple Covering Problem. Information Processing Letters 65, 67–69 (1998)Google Scholar
  29. 29.
    http://www.oreas.deGoogle Scholar
  30. 30.
    Padberg, M.W., Rinaldi, G.: A Branch-and-Cut Algorithm for the Resolution of Large Scale Symmetric Travelling Salesman Problems. SIAM Review 33, 60–100 (1991)Google Scholar
  31. 31.
    Sherali, H.D., Smith, J.C.: Improving Discrete Model Representations via Symmetry Considerations. Management Science 47, 1396–1407 (2001)Google Scholar
  32. 32.
    Thienel, S.: ABACUS - A Branch-And-CUt System. Ph.D. Thesis, Universität zu Köln, 1995Google Scholar
  33. 33.
    Wolsey, L.A.: Integer Programming, Wiley 1998Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of KentuckyLexington

Personalised recommendations