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.
CITATION STYLE
Margot, F. (2001). Pruning by isomorphism in branch-and-cut. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 304–317). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_24
Mendeley helps you to discover research relevant for your work.