Hybrid Algorithms for the Constraint Satisfaction Problem.
Patrick ProsserPublished in: Comput. Intell. (1993)
Keyphrases
- hybrid algorithms
- constraint satisfaction problems
- sat problem
- constraint satisfaction
- search space
- constraint propagation
- np complete
- metaheuristic
- hill climbing
- hybrid algorithm
- constraint programming
- partial constraint satisfaction
- arc consistency
- np hard
- sat instances
- simulated annealing
- soft constraints
- evolutionary algorithm
- optimization method
- monte carlo
- tabu search
- satisfiability problem
- genetic programming
- objective function