Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Original Constraint Based Approach for Solving over Constrained Problems
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Revisiting the sequence constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
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
Filtering algorithms for discrete cumulative problems with overloads of resource
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The balanced academic curriculum problem revisited
Journal of Heuristics
The weighted average constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
FOCUS: a constraint for concentrating high costs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Three generalizations of the FOCUS constraint
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
This paper introduces DEVIATION, a soft global constraint to obtain balanced solutions. A violation measure of the perfect balance can be defined as the Lpnorm of the vector variables minus their mean. SPREADconstraints the sum of square deviations to the mean [5,7] i.e.the L2norm. The L1norm is considered here. Neither criterion subsumes the other but the design of a propagator for L1is simpler. We also show that a propagator for DEVIATIONruns in $\mathcal{O}(n)$ (with respect to the number of variables) against $\mathcal{O}(n^2)$ for SPREAD.