Automatic Generation of Symmetry-Breaking Constraints

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.

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Leo Liberti
• Keywords: Branch-and-Bound Based Solution, COCOA 2008, Discrete Geometry, Integer Linear Programs, Solution Symmetries