Tabu Search for Maximal Constraint Satisfaction Problems.
Philippe GalinierJin-Kao HaoPublished in: CP (1997)
Keyphrases
- partial constraint satisfaction
- tabu search
- constraint satisfaction problems
- metaheuristic
- constraint satisfaction
- simulated annealing
- search space
- scheduling problem
- feasible solution
- search algorithm
- np hard
- memetic algorithm
- np complete
- path relinking
- combinatorial problems
- constraint propagation
- soft constraints
- heuristic methods
- vehicle routing problem
- genetic algorithm
- constraint programming
- job shop scheduling problem
- search procedure
- tabu search algorithm
- scatter search
- hybrid algorithm
- arc consistency
- sat problem
- max sat
- combinatorial optimization
- non binary
- solving constraint satisfaction problems
- hyper heuristics
- graph coloring
- temporal constraints
- global constraints
- traveling salesman problem
- linear programming
- special case
- optimal solution