Zanarini, A.
Pesant, G.
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.
Référence bibliographique |
Zanarini, A. ; Pesant, G.. Generalizations of the global cardinality constraint for hierarchical resources.Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007 (Brussels, Belgium, 23-26 May 2007). In: Van Hentenryck, P.; Wolsey, L.;, Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007, Springer-verlag2007, p. 361-375 |
Permalien |
http://hdl.handle.net/2078.1/67846 |