Revisiting the soft global cardinality constraint
(2010) 7th International Conference, CPAIOR 2010 — Location: Bologna, Italy (14.June.2010)
Files
cpaior10-softgcc.pdf
Restricted Access - Adobe PDF
- 151.55 KB
Details
- Authors
- Abstract
- The Soft Global Cardinality Constraint (softggc) relaxes the Global Cardinality Constraint (gcc) by introducing a violation variable representing unmet requirements on the number of value occurrences. A first domain consistent filtering algorithm was introduced by Van Hoeve et al. in 2004 using a minimum cost flow algorithm. A simpler and more efficient filtering algorithm was introduced in 2006 by Zanarini et al. using matchings in bipartite graphs. While the consistency check introduced in the second algorithm is correct, we show that the algorithm may not achieve domain consistency when cardinality requirements contain zeroes. We give new domain consistent conditions and show how to achieve domain consistency within the same time bounds. The softggc constraint was implemented in Comet.
- Affiliations
Citations
Schaus, P., Van Hentenryck, P., & Zanarini, A. (2010). Revisiting the soft global cardinality constraint. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, p. 307-312. https://doi.org/10.1007/978-3-642-13520-0_33