Improved CLP scheduling with task intervals
Proceedings of the eleventh international conference on Logic programming
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem
Annals of Mathematics and Artificial Intelligence
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Principles of Constraint Programming
Principles of Constraint Programming
Invited contribution: hybrid CSP solving
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Integration of constraint programming and metaheuristics
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
| Hi-index | 0.00 |
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.