Name
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. |
Year | Venue | Keywords |
|---|---|---|
2011 | CP | bound-consistency algorithm,INCREASINGSUM constraint,increasing sum constraint,variables X |
Field | DocType | Citations |
Discrete mathematics,Combinatorics,Mathematical optimization,Algorithm,Mathematics | Conference | 4 |
PageRank | References | Authors |
0.49 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thierry Petit | 1 | 4 | 0.49 |
| Jean-charles Régin | 2 | 1312 | 96.59 |
| Nicolas Beldiceanu | 3 | 547 | 51.14 |