Global cut framework for removing symmetries

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

Volumn 2239, Issue , 2001, Pages 77-92

  Focacci, Filippo ^a   Milano, Michaela ^b  

^a IBM   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORESTRY; SIGNAL FILTERING AND PREDICTION;

ENTIRE SEARCHES; FILTERING ALGORITHM; SEARCH STRATEGIES; SEARCH TREES;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (15)

1. F. Bacchus. A uniform view of backtracking. In Unpublished manuscript, 2000. http://www.cs.toronto.edu/˜fbacchus/on-line.
2. R. Backofen and S. Will. Excluding symmetries in constraint based search. In Proceedings CP’99, pages 400–405, 1999.
3. B. Benhamou. Study of symmetries in constraint satisfaction problems. In Proceedings of PPCP’94, LNCS - Springer Verlag, 1994.
4. F. Focacci. Solving Combinatorial Optimization Problems in Constraint Programming. PhD thesis, Fac. Ingegneria, Universita’ di Ferrara, Italy, 2001. http://www-lia.deis.unibo.it/Research/TechReport/lia01005.zip.
5. E. Freuder. Eliminating interchangeble values in constraint satisfaction problems. In Proceedings AAAI’91, pages 227–233, 1991.
6. I.P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In TR 99.02 School of Computer Studies, 1999.
7. I.P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In W.Horn, editor, Proceedings ECAI2000, pages 599–603, 2000.
8. W. Harvey and M. Ginsberg. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence - IJCAI, pages 607–615. Morgan Kaufmann, 1995.
9. P. Meseguer and C. Torras. Solving strategies for highly symmetric csps. In Proceedings IJCAI’99, pages 400–405, 1999.
10. P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Journal of Artificial Intelligence, 129:133–163, 2001.
11. M Padberg and G Rinaldi. Optimization of a 532-symmetric traveling salesman problem. Operations Research Letters, 6:1–8, 1987.
12. J. F. Puget. On the satisfiability of symmetrical constraint satisfaction problems. In Proceedings ISMIS’93, pages 350–361, 1993.
13. P. Roy and F. Pachet. Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In Proceedings of ECAI98 Workshop on Non Binary Constraints, pages 27–33, 1998.
14. B. Smith. Reducing symmetries in a combinatorial design problem. In Proceedings CPAIOR01, 2001.
15. T. Walsh. Depth-bounded discrepancy search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence - IJCAI. Morgan Kaufmann, 1997.