Filtering Atmost1 on Pairs of Set Variables
Many combinatorial problems, such as bin packing, set covering, and combinatorial design, can be conveniently expressed using set variables and constraints over these variables . In constraint programming such problems can be modeled directly in their natural form by means of set variables. This offers a great potential in exploiting the structure captured by set variables during the solution process, for example to break problem symmetry or to improve domain filtering.
We present an efficient filtering algorithm, establishing bounds consistency, for the atmost1 constraint on pairs of set variables with fixed cardinality. Computational results on social golfer benchmark problems demonstrate that with this additional filtering, these problems can be solved up to 50 times faster.
Unable to display preview. Download preview PDF.
- 1.Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: Disjoint, partition and intersection constraints for set and multiset variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 138–152. Springer, Heidelberg (2004)Google Scholar
- 3.Gervet, C.: Constraints over structured domains. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Elsevier, Amsterdam (2006)Google Scholar
- 4.Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: AAAI 1996, vol. 1, pp. 209–215 (1996)Google Scholar
- 5.Sadler, A., Gervet, C.: Global reasoning on sets. In: Proc. of Workshop on Modelling and Problem Formulation (FORMUL 2001) (2001)Google Scholar