Complete Bound Consistency for the Global Cardinality Constraint
- 1 July 2005
- journal article
- Published by Springer Nature in Constraints
- Vol. 10 (3) , 191-217
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Tractability of Global Constraints2004
- Improved Algorithms for the Global Cardinality Constraint2004
- Cost-Based Filtering for Shorter Path ConstraintsLecture Notes in Computer Science, 2003
- An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint2003
- Fast Bound Consistency for the Global Cardinality ConstraintLecture Notes in Computer Science, 2003
- Approximated Consistency for Knapsack ConstraintsLecture Notes in Computer Science, 2003
- Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent ConstraintLecture Notes in Computer Science, 2000
- A deductive and object-oriented approach to a complex scheduling problemLecture Notes in Computer Science, 1993
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985