GCC-like restrictions on the Same constraint

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

Volumn 3419 LNAI, Issue , 2005, Pages 1-11

  Beldiceanu, Nicolas ^a   Katriel, Irit ^b   Thiel, Sven ^b  

^a CNRS   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING; SET THEORY;

ARC-CONSISTENCY; GCC-LIKE RESTRICTIONS; MULTISET OF VALUES;

CONSTRAINT THEORY;

EID: 26844439978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_1     Document Type: Conference Paper

References (12)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. N. Beldiceanu, I. Katriel, and S. Thiel. Filtering algorithms for the Same constraint. In First International Conference on Integration of Aland OR Techniques in Contraint Programming for Combinatorial Optimization Problems (CPAIOR 2004), volume 3011 of Lecture Notes in Computer Science, pages 65-79, Nice, France, 2004. Springer.
3. F. Glover. Maximum matchings in a convex bipartite graph. Naval Res. Logist. Quart., 14:313-316, 1967.
4. L. R. Ford Jr. and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
5. I. Katriel and S. Thiel. Fast bound consistency for the global cardinality constraint. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), volume 2833 of LNCS, pages 437-451, 2003.
6. K. Mehlhorn and S. Thiel. Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP 2000), volume 1894 of LNCS, pages 306-319, 2000.
7. C.-G. Quimper, A. López-Ortiz, P. van Beek, and A. Golynski. Improved algorithms for the global cardinality constraint. In M. Wallace, editor, Principles and Practice of Constraint Programming (CP'2004), volume ? of LNCS, pages ?-? Springer-Verlag, 2004.
8. C.-G. Quimper, P. van Beek, A. Lopez-Ortiz, A. Golynski, and S. B. Sadjad. An efficient bounds consistency algorithm for the global cardinality constraint. In Principles and Practice of Constraint Programming, pages 600-614, 2003.
9. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), pages 362-367, 1994.
10. J.-C. Régin. Generalized Arc-Consistency for Global Cardinality Constraint. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 209-215, 1996.
11. Médecins sans Frontières. http://www.doctorswithoutborders.org/.
12. W.J. van Hoeve. The alldifferent constraint: A survey. In Submitted manuscript. Available from http://www.cwi.nl/wjvh/papers/alldiff.pdf, 2001.