Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems.
Hugo Terashima-MarínJosé Carlos Ortiz-BaylissPeter RossManuel Valenzuela-RendónPublished in: GECCO (2008)
Keyphrases
- constraint satisfaction problems
- hyper heuristics
- forward checking
- variable ordering
- constraint satisfaction
- constraint programming
- np complete
- constraint propagation
- graph coloring
- search space
- combinatorial problems
- genetic programming
- non binary
- arc consistency
- evolutionary algorithm
- np hard
- branch and bound algorithm
- global constraints
- search tree
- phase transition
- difficult problems
- timetabling problem
- heuristic search
- special case