Models and symmetry breaking for 'peaceable armies of queens'

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

Volumn 3011, Issue , 2004, Pages 271-286

  Smith, Barbara M ^a   Petrie, Karen E ^a   Gent, Ian P ^b  

^a UNIVERSITY OF HUDDERSFIELD   (United Kingdom)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMAL SYSTEMS;

CHESS BOARDS; CONSTRAINT PROGRAMMING; NON-ISOMORPHIC; OPTIMAL SOLUTIONS; OPTIMALITY; OPTIMIZATION PROBLEMS; SYMMETRY-BREAKING; VARIABLE ORDERING HEURISTICS;

OPTIMIZATION;

EID: 35048855564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_19     Document Type: Article

References (6)

1. R.A. Bosch. Peaceably Coexisting Armies of Queens. Optima (Newsletter of the Mathematical Programming Society), 62:6-9, 1999.
2. B.M.W. Cheng, K.M.F. Choi, J.H.M. Lee, and J.C.K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4:167-192, 1999.
3. M. Gardner. Chess Queens and Maximum Unattacked Cells. Math Horizon, pages 12-16, November 1999.
4. I.P. Gent and B.M. Smith. Symmetry Breaking During Search in Constraint Programming. In W. Horn, editor, Proceedings ECAI'2000, pages 599-603, 2000.
5. B.M. Smith. Dual Models of Permutation Problems. In Proceedings of CP'01: the 7th International Conference on Principles and Practice of Constraint Programming, LNCS 2239, pages 615-619. Springer, 2001.
6. M. Velucchi. For me, this is the best chess-puzzle: Non-dominating queens problem. http://anduin.eldar.org/∼problemi/papers.html. Accessed January 2004.