Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
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
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
The Difference All-Difference Makes
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
When do bounds and domain propagation lead to the same search space
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
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
Computing leximin-optimal solutions in constraint networks
Artificial Intelligence
Decompositions of all different, global cardinality and related constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications.