Abstract
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to specifically address this issue, particularly at the modeling level. We propose a new constraint dedicated to balancing, based on well-known and well-understood concepts in statistics. We show how it can be used to model different situations in which balance is important. We also design efficient filtering algorithms to guide the search towards balanced solutions. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Pesant, G., & Régin, J. C. (2005). Spread: A balancing constraint based on statistics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 460–474). https://doi.org/10.1007/11564751_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.