ALCOMFT-TR-02-91

Torsten Fahle, Stefan Schamberger and Meinolf Sellmann
Symmetry Breaking
Paderborn. Work packages 3 and 4. May 2002.

Abstract: Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome the problem is to employ sophisticated models with no or at least less symmetries. However, this often requires a lot of experience from the user who is carrying out the modeling. Moreover, some problems even contain inherent symmetries that cannot be broken by remodeling. We present an approach that detects symmetric choice points during the search. It enables the user to find solutions for complex problems with minimal effort spent on modeling.

Postscript file: ALCOMFT-TR-02-91.ps.gz (232 kb).