Abstract
The paper presents a Branch-and-Cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating cuts. The cuts are non standard, cutting integer feasible solutions but leaving unchanged the optimal value of the problem. Pruning and cut generation are performed by backtracking procedures using a Schreier-Sims table for representing the group. Applications to the generation of covering designs and error correcting codes are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Butler G. “Computing in Permutation and Matrix Groups II: Backtrack Algorithm”, Mathematics of Computation 39 (1982), 671–680.
Butler G., Fundamental Algorithms for Permutation Groups, Lecture Notes in Computer Science 559, Springer (1991).
Butler G., Cannon J.J., “Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series”, Mathematics of Computation 39 (1982), 663–670.
Butler G., Lam W.H., “A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects”, J. Symbolic Computation 1 (1985), 363–381.
Conway J.H., Sloane N.J.A., Sphere Packings, Lattices and Groups, Springer (1993).
Etzion T., Wei V., Zhang Z., “Bounds on the Sizes of Constant Weight Covering Codes”, Designs, Codes and Cryptography 5 (1995), 217–239.
Gibbons P.B., “Computational Methods in Design Theory”, in: The CRC Handbook of Combinatorial Designs, Colbourn C.J., Dinitz J.H (eds.), CRC Press (1996),718–740.
Ivanov A.V., “Constructive Enumeration of Incidence Systems”, Annals of Discrete Mathematics 26 (1985), 227–246.
Jünger M., Thienel S., “Introduction to ABACUS — A Branch-And-CUt System”, Operations Research Letters 22 (1998), 83–95.
Kreher D.L., Stinson D.R.,Combinatorial Algorithms, Generation, Enumeration,and Search, CRC Press (1999).
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 (1980), 941–974.
Leon J.S., “Computing Automorphism Groups of Combinatorial Objects“, in Computational Group Theory, Atkinson M.D. (ed.), Academic Press (1984), 321–335.
Luetolf C., Margot F., “A Catalog of Minimally Nonideal Matrices”, Mathematical Methods of Operations Research 47 (1998), 221–241.
Margot F., “Small Covering Designs by Branch-and-Cut”, Research report 2000-27, Department of Mathematics, University of Kentucky.
McKay D., “Isomorph-free Exhaustive Generation”,Journal of Algorithms 26 (1998), 306–324.
Mills W.H., Mullin R.C., “Coverings and Packings”, in: Contemporary Design Theory: A collection of Surveys, Dinitz H., Stinson D.R. (eds.), Wiley (1992), 371–399.
Read R.C., “Every One a Winner or How to Avoid Isomorphism Search When Cataloguing Combinatorial Configurations“, Annals of Discrete Mathematics 2 (1978), 107–120.
Seah E., Stinson D.R., “An Enumeration of Non-isomorphic One-factorizations and Howell Designs for the Graph K10 minus a One-factor”, Ars Combinatorica 21 (1986), 145–161.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Margot, F. (2001). Pruning by Isomorphism in Branch-and-Cut. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive