Using Local Search for guiding enumeration in constraint solving. Crawford, B., Castro, C. I., & Monfroy, É. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 4183 LNCS, pages 56-65, 2006.
abstract   bibtex   
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.
@inproceedings{33750232477,
    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.",
    year = "2006",
    title = "Using Local Search for guiding enumeration in constraint solving",
    volume = "4183 LNCS",
    pages = "56-65",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    author = "Crawford, Broderick and Castro, Carlos Ivan and Monfroy, Éric"
}
Downloads: 0