A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Filtering algorithms for the multiset ordering constraint
Artificial Intelligence
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
The conjunction of interval among constraints
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The extended global cardinality constraint: an empirical survey (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We show an algorithm for bound consistency of global cardinality constraints, which runs in time O(n + n驴) plus the time required to sort the assignment variables by range endpoints, where n is the number of assignment variables and n驴 is the number of values in the union of their domains. It is the first efficient algorithm that achieves bound consistency for all variables, and not only the assignment variables.