An efficient bounds consistency algorithm for the global cardinality constraint

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

Volumn 2833, Issue , 2003, Pages 600-614

  Quimper, Claude Guy ^a   Van Beek, Peter ^a   López Ortiz, Alejandro ^a   Golynski, Alexander ^a   Sadjad, Sayyed Bashir ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

BOUNDS CONSISTENCY; CARDINALITY CONSTRAINTS; COMMERCIAL IMPLEMENTATION; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATORS; DOMAIN CONSISTENCY; GLOBAL CARDINALITY CONSTRAINT; WORST-CASE PERFORMANCE;

ALGORITHMS;

EID: 35248897060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_41     Document Type: Article

References (17)

1. Y. Caseau, P.-Y. Guillo, and E. Levenez. A deductive and object-oriented approach to a complex scheduling problem. In Deductive and Object-Oriented Databases, pages 67-80, 1993.
2. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. In STOC-1983, pages 246-251.
3. P. Hall. On representatives of subsets. J. of the London Mathematical Society, pages 26-30, 1935.
4. ILOG S. A. ILOG Solver 4.2 user's manual, 1998.
5. I. Katriel and S. Thiel. Fast bound consistency for the global cardinality constraint. In CP-2003.
6. W. Lipski and F. P. Preparata. Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. In Acta Informatica, 15:329-346, 1981.
7. A. Lopez-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek. A fast and simple algorithm for bounds consistency of the alldifierent constraint. In IJCAI-2003.
8. J.-F. Puget. A fast algorithm for the bound consistency of alldiff constraints. In AAAI-1998, pages 359-366.
9. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. In AAAI-1994, pages 362-367.
10. J.-C. Régin. Generalized arc consistency for global cardinality constraint. In AAAI-1996, pages 209-215.
11. J.-C. Régin and J.-F. Puget. A filtering algorithm for global sequencing constraints. In CP-1997, pages 32-46.
12. C. Schulte and P. J. Stuckey. When do bounds and domain propagation lead to the same search space. In PPDP-2001, pages 115-126.
13. K. Stergiou and T. Walsh. The difference all-difference makes. In IJCAI-1999, pages 414-419.
14. P. van Beek and K. Wilken. Fast optimal instruction scheduling for single-issue processors with arbitrary latencies. In CP-2001, pages 625-639.
15. P. Van Hentenryck, L. Michel, L. Perron, and J.-C. Régin. Constraint programming in OPL. In PPDP-1999, pages 98-116.
16. P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58:113-159, 1992.
17. W. J. van Hoeve. The alldifferent constraint: A survey. Unpublished manuscript, 2001.