Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
Constraint-Based Local Search
Compiling and Executing Declarative Modeling Languages to Gecode
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
| Hi-index | 0.00 |
Resource management problems are generally modeled as Constraint Satisfaction / Optimization Problems (CSPs or COPs). The solution methods for CSPs and COPs can be split into: complete methods , which systematically explore the whole solution space; incomplete methods , which rely on heuristics and focus on interesting areas of the solution space. Our focus is manly in Constrain Programming (CP) and Local Search (LS) techniques. CP languages are usually based on complete methods that analyze the search space alternating constraint propagation phases and variable assignment phases. Their main advantage is flexibility . LS methods , instead, rely on the definition of "proximity" and explore only specific areas of the search space. Their main advantage is efficiency .