Constraints

, Volume 19, Issue 3, pp 195–242

Lightweight dynamic symmetry breaking

Authors

    • Monash University
  • Maria Garcia de la Banda
    • Monash University
  • Bart Demoen
    • KU Leuven
  • Mark Wallace
    • Monash University
Article

DOI: 10.1007/s10601-013-9154-2

Cite this article as:
Mears, C., Garcia de la Banda, M., Demoen, B. et al. Constraints (2014) 19: 195. doi:10.1007/s10601-013-9154-2

Abstract

Symmetries in constraint problems present an opportunity for reducing search. This paper presents Lightweight Dynamic Symmetry Breaking, an automatic symmetry breaking method that is efficient enough to be used as a default, since it never yields a major slowdown while often giving major performance improvements. This is achieved by automatically exploiting certain kinds of symmetry that are common, can be compactly represented, easily and efficiently processed, automatically detected, and lead to large reductions in search. Moreover, the method is easy to implement and integrate in any constraint system. Experimental results show the method is competitive with the best symmetry breaking methods without risking poor performance.

Keywords

SymmetrySymmetry breakingGroup theorySearch

Supplementary material

10601_2013_9154_MOESM1_ESM.zip (15 kb)
(ZIP 14.9 kb)
10601_2013_9154_MOESM2_ESM.zip (18 kb)
(ZIP 17.8 kb)

Copyright information

© Springer Science+Business Media New York 2013