A graph coloring heuristic using partial solutions and a reactive tabu scheme.
Ivo BlöchligerNicolas ZuffereyPublished in: Comput. Oper. Res. (2008)
Keyphrases
- partial solutions
- graph coloring
- tabu search
- hyper heuristics
- search procedure
- combinatorial problems
- search space
- max sat
- job shop scheduling
- metaheuristic
- job shop scheduling problem
- branch and bound
- search heuristics
- scheduling problem
- simulated annealing
- constraint satisfaction problems
- phase transition
- solution quality
- bin packing
- search strategies
- neural network
- constraint programming
- combinatorial optimization
- timetabling problem
- dynamic programming
- search algorithm
- optimal solution