Abstract
In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Monfroy, E., Castro, C., & Crawford, B. (2006). Using Local Search for guiding enumeration in constraint solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4183 LNCS, pp. 56–65). Springer Verlag. https://doi.org/10.1007/11861461_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
