Skip to Main content Skip to Navigation
Journal articles

The Ordered Distribute Constraint

Thierry Petit 1, 2 Jean-Charles Régin 3
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
3 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe CEP
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : In this paper we introduce a new cardinality constraint: Ordered Distribute. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not consider at the same time the occurrences of all the values greater than v. We design an algorithm for achieving generalized arc-consistency on Ordered Distribute, with a time complexity linear in the sum of the number of variables and the number of values in the union of their domains. In addition, we give some experiments showing the advantage of this new constraint for problems where values represent levels whose overrunning has to be under control. Finally, we present three extensions of our constraint that can be particularly useful in practice.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Thierry Petit Connect in order to contact the contributor
Submitted on : Monday, November 26, 2012 - 2:43:26 PM
Last modification on : Tuesday, December 7, 2021 - 4:10:10 PM
Long-term archiving on: : Saturday, December 17, 2016 - 12:21:46 PM


Files produced by the author(s)



Thierry Petit, Jean-Charles Régin. The Ordered Distribute Constraint. International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2011, 20 (4), pp.617-637. ⟨10.1142/S0218213011000371⟩. ⟨hal-00753742⟩



Record views


Files downloads