Pruning by Isomorphism in Branch-and-Cut

Authors:
François Margot
Affiliations:
-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 6
Cited 3

A General backtrack algorithm for the isomorphism problem of combinatorial objects

Journal of Symbolic Computation
Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
Bounds on the sizes of constant weight covering codes

Designs, Codes and Cryptography
Isomorph-free exhaustive generation

Journal of Algorithms
Combinatorial algorithms: generation, enumeration, and search

ACM SIGACT News
Introduction to ABACUS - a branch-and-cut system11Partially supported by ESPRIT LTR Project no. 20244 - ALCOM-IT.

Operations Research Letters

Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Three Ideas for the Quadratic Assignment Problem

Operations Research
Using symmetry to optimize over the sherali-adams relaxation

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.