Bound-consistent deviation constraint

Authors:
Pierre Schaus;Yves Deville;Pierre Dupont
Affiliations:
Department of Computing Sciences and Engineering, Université catholique de Louvain, Belgium;Department of Computing Sciences and Engineering, Université catholique de Louvain, Belgium;Department of Computing Sciences and Engineering, Université catholique de Louvain, Belgium
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 1
Cited 2

Physician scheduling in emergency rooms

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Scalable Load Balancing in Nurse to Patient Assignment Problems

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The weighted average constraint

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

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.