A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

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

Résumé

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

Dates et versions

hal-00753385 , version 1 (19-11-2012)

Identifiants

Citer

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. pp.721-728, ⟨10.1007/978-3-642-23786-7_54⟩. ⟨hal-00753385⟩
353 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More