Abstract
Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable dificulties 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.
This work was partly supported by the German Science Foundation (DFG) project SFB-376, and by the IST Programme of the EU under contract number IST-1999- 14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. C. Bermond and C. Peyrat. De bruijn and kautz networks: a competitor for the hypercube? Proc. of the 1st Europ. Workshop on Hypercubes and Distributed Computers, pp. 279–293, North-Holland, 1989.
CSPLib: a problem library for constraints, maintained by I. P. Gent, T. Walsh, B. Selman, http://www-users.cs.york.ac.uk/~tw/csplib/
R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschöke. A Better Upper Bound on the Bisection Width of de Bruijn Networks. Tech. Report University of Paderborn. short version: Proc. of STACS’97, Springer LNCS 1200:511–522, 1997.
I. P. Gent and B. Smith. Symmetry Breaking During Search in Constraint Programming. Proc. of ECAI’2000, Berlin, pp. 599–603, 2000.
F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129 (1–2) pp. 133–163, 2001.
E. Rothberg. Using Cuts to Remove Symmetry. ISMP’00, Atlanta, 2000.
N. Sensen. Lower Bounds and Exact Algorithms for the Graph Partitioning Problem using Multicommodity Flows. Europ. Symp. on Algorithms, ESA’01, 2001.
H. D. Sherali and J. Cole Smith. Improving Discrete Model Representation Via Symmetry Considerations. ISMP’00, Atlanta, 2000.
B. Smith. Reducing Symmetry in a Combinatorial Design Problem. Proc. of CPAIOR’01, Wye/UK, pp. 351–360, April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fahle, T., Schamberger, S., Sellmann, M. (2001). Symmetry Breaking. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive