Automatic Generation of Symmetry-Breaking Constraints

Authors:
Leo Liberti
Affiliations:
LIX, École Polytechnique, Palaiseau, France F-91128
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 7
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Improving Discrete Model Representations via Symmetry Considerations

Management Science
Packing and partitioning orbitopes

Mathematical Programming: Series A and B
Orbital Branching

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On a Binary-Encoded ILP Coloring Formulation

INFORMS Journal on Computing
Fundamental domains for integer programs with symmetries

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Symmetric ILP: Coloring and small integers

Discrete Optimization

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of solution symmetries, and two different types of symmetry-breaking constraints to eliminate these symmetries at the modelling level. We discuss some preliminary computational results.