A survey of local search methods for graph coloring.
Philippe GalinierAlain HertzPublished in: Comput. Oper. Res. (2006)
Keyphrases
- graph coloring
- combinatorial problems
- sat problem
- max sat
- phase transition
- constraint programming
- job shop scheduling
- np complete problems
- constraint satisfaction problems
- hill climbing
- search methods
- memetic algorithm
- traveling salesman problem
- search problems
- scheduling problem
- combinatorial optimization
- constraint satisfaction
- branch and bound algorithm
- hyper heuristics
- global constraints
- heuristic search
- tabu search
- cost function
- search algorithm