TY - GEN
T1 - Automatic generation of symmetry-breaking constraints
AU - Liberti, Leo
PY - 2008/1/1
Y1 - 2008/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/51849085158
U2 - 10.1007/978-3-540-85097-7_31
DO - 10.1007/978-3-540-85097-7_31
M3 - Conference contribution
AN - SCOPUS:51849085158
SN - 3540850961
SN - 9783540850960
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 328
EP - 338
BT - Combinatorial Optimization and Applications - Second International Conference, COCOA 2008, Proceedings
PB - Springer Verlag
T2 - 2nd International Conference on Combinatorial Optimization and Applications, COCOA 2008
Y2 - 21 August 2008 through 24 August 2008
ER -