Global constraints for lexicographic orderings

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

Volumn 2470, Issue , 2002, Pages 93-108

  Frisch, Alan ^a   Hnich, Brahim ^a   Kiziltan, Zeynep ^b   Miguel, Ian ^a   Walsh, Toby ^c  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UPPSALA UNIVERSITY   (Sweden)

^c UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

BALANCED INCOMPLETE BLOCK DESIGN; CONSTRAINT PROPAGATION; GLOBAL CONSISTENCY ALGORITHM; GLOBAL CONSTRAINTS; LEXICOGRAPHIC ORDER; LEXICOGRAPHIC ORDERING; SOCIAL GOLFERS; TOURNAMENT SCHEDULING;

CONSTRAINT THEORY;

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

References (10)

1. N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. In Proc. of CP’2000, pages 52–66. Springer, 2000
2. C. Bessiére, P. Meseguer, E. C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proc. of CP’99, pages 88–102. Springer, 1999.
3. C. Bessiére and J. C. Régin. Arc consistency for general constraint networks: Preliminary results. In Proc. of IJCAI’97, pages 398–404. Morgan Kaufmann, 1997.
4. M. Ehrgott and X. Gandibleux. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum, 22:425–460, 2000.
5. P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking row and column symmetries in matrixmo dels. In Proc. of CP’2002. Springer, 2002
6. P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Matrixmo delling. Technical Report APES-36-2001, APES group, 2001. Available from http://www.dcs.st-and.ac.uk/~apes/reports/apes-36-2001.ps.gz. Presented at Formul’01, CP’2001 post-conference workshop.
7. E. Freuder. A sufficient condition for backtrack-bounded search. Journal of the Association for Computing Machinery, 32(4):755–761, 1985.
8. A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Global constraints for lexicographical orderings. Technical Report APES-51-2002, APES group, 2002. Available from http://www.dcs.st-and.ac.uk/~apes/reports/apes-51-2001.ps.gz.
9. I. P. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence, 123(1-2):133–156, 2000.
10. P. Van Hentenryck, L. Michel, L. Perron, and J. C. Régin. Constraint programming in OPL. In Proc. of PPDP’99, pages 98–116. Springer, 1999