Name
Title | ||
|---|---|---|
An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization |
Abstract | ||
|---|---|---|
This paper gives an O(n log n) bound-consistency filtering algorithm for the conjunction alldifferent(V0, V1,..., Vn-1). f(V0). f(V1). . f(Vn-1) = cst, (V0, V1,..., Vn-1, cst. N+), where (N,.) is a commutative group, f is a unary function, and both. and f are monotone increasing. This complexity is equal to the complexity of the bound-consistency algorithm of the alldifferent constraint. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3233/978-1-61499-098-7-145 | Frontiers in Artificial Intelligence and Applications |
Field | DocType | Volume |
Abelian group,Mathematical optimization,Computer science,Algorithm,Unary function,Time complexity,Monotone polygon | Conference | 242 |
ISSN | Citations | PageRank |
0922-6389 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Beldiceanu | 1 | 547 | 51.14 |
| Mats Carlsson | 2 | 975 | 79.24 |
| Thierry Petit | 3 | 0 | 0.34 |
| Jean-charles Régin | 4 | 1312 | 96.59 |