This paper introduces the Increasing-Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is less than or equal to its successor. This constraint is a specialization of the Nvalue constraint, motivated by symmetry breaking. Propagating the Nvalue constraint is known as an NP-hard problem. However, we show that the chain of non strict inequalities on the variables makes the problem polynomial. We propose an algorithm achieving generalized arc-consistency in O(∑Di) time, where ∑Di is the sum of domain sizes. This algorithm is an improvement of filtering algorithms obtained by the automaton-based or the Slide-based reformulations. We evaluate our constraint on a resource allocation problem. © 2010 Springer-Verlag.
CITATION STYLE
Beldiceanu, N., Hermenier, F., Lorca, X., & Petit, T. (2010). The increasing Nvalue constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6140 LNCS, pp. 25–39). https://doi.org/10.1007/978-3-642-13520-0_5
Mendeley helps you to discover research relevant for your work.