Automatic Generation of Heuristics for Constraint Satisfaction Problems.
José Carlos Ortiz-BaylissJorge Humberto Moreno-ScottHugo Terashima-MarínPublished in: NICSO (2013)
Keyphrases
- constraint satisfaction problems
- hyper heuristics
- finding optimal solutions
- backtrack search
- constraint satisfaction
- search space
- random instances
- constraint programming
- constraint solvers
- variable ordering heuristics
- combinatorial problems
- ordering heuristics
- heuristic search
- constraint propagation
- arc consistency
- np complete
- non binary
- constraint solving
- hard problems
- search algorithm
- soft constraints
- np hard
- computational problems
- constraint networks
- temporal constraints
- finite domain
- backtracking search
- sat problem
- constraint problems
- forward checking
- solving constraint satisfaction problems
- global constraints
- special case
- partial constraint satisfaction
- dynamic constraint satisfaction problems
- constraint solver
- decomposition methods
- traveling salesman problem
- metaheuristic
- lower bound