Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems.
Andrea SchaerfPublished in: IJCAI (1997)
Keyphrases
- constraint satisfaction problems
- backtrack search
- hard constraints
- search space
- constraint satisfaction
- constraint propagation
- scheduling problem
- constraint programming
- graph coloring problems
- backtracking algorithms
- np complete
- combinatorial problems
- search algorithm
- non binary
- constraint solving
- np hard
- constraint networks
- soft constraints
- tree search
- temporal constraints
- tabu search
- tractable classes
- decomposition methods
- pseudo boolean optimization
- job shop scheduling problem
- arc consistency
- sat problem
- genetic algorithm
- constraint problems
- constraint optimization
- backtracking search
- optimal solution
- memetic algorithm
- symmetry breaking
- constraint solver
- forward checking
- search tree
- branch and bound
- solving constraint satisfaction problems
- combinatorial optimization