Abstract
A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain number of variables of a set X must take a value in the set V.
This paper studies several combinations of among constraints and several conjunctions of among constraints and cardinality constraints. Some filtering algorithms are proposed and they are characterized when it is possible. Moreover, a weak form of Singleton arc consistency is considered. At last, it is shown how the global sequencing constraint and the global minimum distance constraint can be easily modeled by some conjunctions of cardinality and among constraints. Some results are also given for the global minimum distance constraint. They show that our study outperforms the existing constraint in ILOG Solver.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge, C.: Graphe et Hypergraphes. Dunod, Paris (1970)
Tarjan, R.: Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics (1983)
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Englewood Cliffs (1993)
Van Hentenryck, P., Carillon, J.P.: Generality Versus Specificity: An Experience with AI and OR Techniques. In: Proceedings of AAAI 1988 (1988)
Van Hentenryck, P., Deville, Y., Teng, C.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (1992)
Régin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proceedings AAAI 1996, Portland, Oregon, pp. 209–215 (1996)
Régin, J.C., Gomes, C.: The cardinality matrix constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 572–587. Springer, Heidelberg (2004)
Quimper, C.G., López-Ortiz, A., van Beek, P., Golynski, A.: Improved algorithms for the global cardinality constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 542–556. Springer, Heidelberg (2004)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1, 146–160 (1972)
Papadimitriou, C.H.: Computational complexity. Addison Wesley, Reading (1994)
Régin, J.C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997)
Régin, J.C.: The global minimum distance constraint. Technical report, ILOG (1997)
ILOG: ILOG Solver 4.4 User’s manual. ILOG S.A. (1999)
Régin, J.C.: Global Constraints and Filtering Algorithms. In: Milano, M. (ed.) Constraints and Integer Programming combined. Kluwer, Dordrecht (2003)
Régin, J.C.: Modélisation et Contraintes globales en programmation par contraintes. Habilitation à diriger des Recherches, Université de Nice-Sophia Antipolis (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Régin, JC. (2005). Combination of Among and Cardinality Constraints. In: Barták, R., Milano, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2005. Lecture Notes in Computer Science, vol 3524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493853_22
Download citation
DOI: https://doi.org/10.1007/11493853_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26152-0
Online ISBN: 978-3-540-32264-1
eBook Packages: Computer ScienceComputer Science (R0)