Symmetry breaking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 93-107

  Fahle, Torsten ^a   Schamberger, Stefan ^a   Sellmann, Meinolf ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Golfer problem; Graph partitioning; N queens problem; Symmetry breaking during search

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLEX PROBLEMS; CONSTRAINT SATISFACTION; GOLFER PROBLEM; GRAPH PARTITIONING; INHERENT SYMMETRY; N-QUEENS PROBLEMS; SYMMETRY-BREAKING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947940034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_7     Document Type: Conference Paper

References (11)

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.
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. R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschoke. 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.
4. I.P. Gent and B. Smith. Symmetry Breaking During Search in Constraint Programming. Proc. of ECAI’2000, Berlin, pp. 599–603, 2000.
5. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
6. P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129 (1–2) pp. 133–163, 2001.
7. E. Rothberg. Using Cuts to Remove Symmetry. ISMP’00, Atlanta, 2000.
8. ILOG. Ilog Solver. Reference manual and user manual. V5.0, ILOG, 2000.
9. N. Sensen. Lower Bounds and Exact Algorithms for the Graph Partitioning Problem using Multicommodity Flows. Europ. Symp. on Algorithms, ESA’01, 2001.
10. H.D. Sherali and J. Cole Smith. Improving Discrete Model Representation Via Symmetry Considerations. ISMP’00, Atlanta, 2000.
11. B. Smith. Reducing Symmetry in a Combinatorial Design Problem. Proc. of CPAIOR’01, Wye/UK, pp. 351–360, April 2001.