Arc Consistency for Global Cardinality Constraints with Costs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Principles of Constraint Programming
Principles of Constraint Programming
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Hierarchically nested convex VCSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Automated reencoding of boolean formulas
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Hi-index | 0.00 |
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.