Abstract
We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such constraints allow the expression of requirements, in terms of lower and upper bounds, for resources with different capabilities. Alternate models using gcc’s are shown to be weaker. We present filtering algorithms based on flow theory that achieve domain consistency and give experimental evidence of the usefulness of such constraints. We consider an optimization version of the constraints and discuss its relationship with the cost_gcc.
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
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Elbassioni, K., Katriel, I., Kutz, M., Mahajan, M.: Simultaneous Matchings. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 106–115. Springer, Heidelberg (2005)
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)
Régin, J.-C.: Arc Consistency for Global Cardinality Constraints with Costs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 390–404. Springer, Heidelberg (1999)
Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 209–215. AAAI Press, Menlo Park (1996)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)
Challenge Roadef 2007 (2007-01-30), http://gilco.inpg.fr/ChallengeROADEF2007/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zanarini, A., Pesant, G. (2007). Generalizations of the Global Cardinality Constraint for Hierarchical Resources. In: Van Hentenryck, P., Wolsey, L. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2007. Lecture Notes in Computer Science, vol 4510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72397-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-72397-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72396-7
Online ISBN: 978-3-540-72397-4
eBook Packages: Computer ScienceComputer Science (R0)