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. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Liberti, L. (2008). Automatic generation of symmetry-breaking constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 328–338). Springer Verlag. https://doi.org/10.1007/978-3-540-85097-7_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
