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

  • Thierry Petit
  • Jean-Charles Régin
  • Nicolas Beldiceanu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6876)

Abstract

Given a sequence of variables X = 〈x0, x1, …, xn − 1 〉, we consider the IncreasingSum constraint, which imposes ∀ i ∈ [0, n − 2] xi ≤ xi + 1, and \(\sum_{x_i \in X} x_i = s\). We propose an Θ(n) bound-consistency algorithm for IncreasingSum.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Choco: An open source Java CP library, documentation manual (2011), http://www.emn.fr/z-info/choco-solver/
  2. 2.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979) ISBN 0-7167-1045-5MATHGoogle Scholar
  3. 3.
    Harvey, W., Schimpf, J.: Bounds Consistency Techniques for Long Linear Constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 39–46. Springer, Heidelberg (2002)Google Scholar
  4. 4.
    Régin, J.-C., Rueher, M.: Inequality-sum: a global constraint capturing the objective function. RAIRO - Operations Research 39, 123–139 (2005)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thierry Petit
    • 1
  • Jean-Charles Régin
    • 2
  • Nicolas Beldiceanu
    • 1
  1. 1.TASC team (INRIA/CNRS)Mines de NantesFrance
  2. 2.I3S UMR 6070, CNRSUniversité de Nice-Sophia AntipolisFrance

Personalised recommendations