A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint

Thierry Petit 1 Jean-Charles Régin 2 Nicolas Beldiceanu 1, *
* Auteur correspondant
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : Given a sequence of variables X = 〈x 0, x 1, ..., x n − 1 〉, we consider the IncreasingSum constraint, which imposes ∀ i ∈ [0, n − 2] x i ≤ x i + 1, and ∑xi∈Xxi=s . We propose an Θ(n) bound-consistency algorithm for IncreasingSum
Type de document :
Communication dans un congrès
17th International Conference on Principles and Practice of Constraint Programming (CP'11), Sep 2011, Perugia, Italy. Springer, 6876, pp.721-728, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-23786-7_54>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00753385
Contributeur : Contraintes Lina <>
Soumis le : lundi 19 novembre 2012 - 10:54:42
Dernière modification le : mercredi 7 octobre 2015 - 01:16:47

Identifiants

Collections

Citation

Thierry Petit, Jean-Charles Régin, Nicolas Beldiceanu. A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint. 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Sep 2011, Perugia, Italy. Springer, 6876, pp.721-728, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-23786-7_54>. <hal-00753385>

Partager

Métriques

Consultations de la notice

347