Bound-consistent deviation constraint

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean is rational. We introduce bound-consistent propagators running in linear time with respect to the number of variables. We evaluate the improvement in terms of efficiency and pruning obtained with the new propagators on the Balanced Academic Curriculum Problem. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Schaus, P., Deville, Y., & Dupont, P. (2007). Bound-consistent deviation constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 620–634). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free