Advertisement

Symmetry Breaking

  • Torsten Fahle
  • Stefan Schamberger
  • Meinolf Sellmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

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.

Keywords

symmetry breaking during search graph partitioning n-queens problem golfer problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    CSPLib: a problem library for constraints, maintained by I. P. Gent, T. Walsh, B. Selman, http://www-users.cs.york.ac.uk/~tw/csplib/
  3. 3.
    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.Google Scholar
  4. 4.
    I. P. Gent and B. Smith. Symmetry Breaking During Search in Constraint Programming. Proc. of ECAI’2000, Berlin, pp. 599–603, 2000.Google Scholar
  5. 5.
    F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.Google Scholar
  6. 6.
    P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129 (1–2) pp. 133–163, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    E. Rothberg. Using Cuts to Remove Symmetry. ISMP’00, Atlanta, 2000.Google Scholar
  8. 9.
    N. Sensen. Lower Bounds and Exact Algorithms for the Graph Partitioning Problem using Multicommodity Flows. Europ. Symp. on Algorithms, ESA’01, 2001.Google Scholar
  9. 10.
    H. D. Sherali and J. Cole Smith. Improving Discrete Model Representation Via Symmetry Considerations. ISMP’00, Atlanta, 2000.Google Scholar
  10. 11.
    B. Smith. Reducing Symmetry in a Combinatorial Design Problem. Proc. of CPAIOR’01, Wye/UK, pp. 351–360, April 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Torsten Fahle
    • 1
  • Stefan Schamberger
    • 1
  • Meinolf Sellmann
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderborn

Personalised recommendations