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 the optimal value of the problem unchanged. Pruning and cut generation are performed by backtracking procedures using a Schreier-Sims table for representing the group. Applications to hard set covering problems and to the generation of covering designs and error correcting codes are presented.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 2001 / Accepted: October 2002 Publication online: December 9, 2002
Key Words. branch-and-cut – isomorphism pruning – symmetry
Rights and permissions
About this article
Cite this article
Margot, F. Pruning by isomorphism in branch-and-cut. Math. Program., Ser. A 94, 71–90 (2002). https://doi.org/10.1007/s10107-002-0358-2
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0358-2