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. © Springer-Verlag 2003.
CITATION STYLE
Quimper, C. G., Van Beek, P., López-Ortiz, A., Golynski, A., & Sadjad, S. B. (2003). 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), 2833, 600–614. https://doi.org/10.1007/978-3-540-45193-8_41
Mendeley helps you to discover research relevant for your work.