The Balance Constraint Family

Abstract : The Balance constraint introduced by Beldiceanu ensures solutions are balanced. This is useful when, for example, there is a requirement for solutions to be fair. Balance bounds the difference B between the minimum and maximum number of occurrences of the values assigned to the variables. We show that achieving domain consistency on Balance is NP-hard. We therefore introduce a variant, AllBalance with a similar semantics that is only polynomial to propagate. We consider various forms of AllBalance and focus on AtMostallBalance which achieves what is usually the main goal, namely constraining the upper bound on B. We provide a specialized propagation algorithm, and a powerful decomposition both of which run in low polynomial time. Experimental results demonstrate the promise of these new filtering methods.
Type de document :
Communication dans un congrès
CP: Principles and Practice of Constraint Programming, Sep 2014, Lyon, France. 20th International Conference on Principles and Practice of Constraint Programming, pp.174-189, 2014, LNCS. 〈10.1007/978-3-319-10428-7_15〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01067459
Contributeur : Joël Quinqueton <>
Soumis le : mardi 23 septembre 2014 - 14:34:00
Dernière modification le : mercredi 28 février 2018 - 10:23:14

Lien texte intégral

Identifiants

Citation

Christian Bessière, Emmanuel Hébrard, George Katsirelos, Zeynep Kiziltan, Emilie Picard-Cantin, et al.. The Balance Constraint Family. CP: Principles and Practice of Constraint Programming, Sep 2014, Lyon, France. 20th International Conference on Principles and Practice of Constraint Programming, pp.174-189, 2014, LNCS. 〈10.1007/978-3-319-10428-7_15〉. 〈lirmm-01067459〉

Partager

Métriques

Consultations de la notice

199