A Θ(n) bound-consistency algorithm for the increasing sum constraint

  • Authors:

  • Thierry Petit;Jean-Charles Régin;Nicolas Beldiceanu

  • Affiliations:

  • TASC team (INRIA/CNRS), Mines de Nantes, France;Université de Nice-Sophia Antipolis, I3S UMR 6070, CNRS, France;TASC team (INRIA/CNRS), Mines de Nantes, France

  • Venue:
  • CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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 ΣxiεXxi = s. We propose an Θ(n) bound-consistency algorithm for INCREASINGSUM.