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

Description

This paper gives an O(nlog 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∊ +), where (,⌖) 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.

Abstract

International audience

Additional details