Heuristic methods for graph coloring problems.
Andrew LimYi ZhuQ. LouBrian RodriguesPublished in: SAC (2005)
Keyphrases
- heuristic methods
- graph coloring problems
- scheduling problem
- constraint satisfaction problems
- tabu search
- satisfiability problem
- optimal solution
- efficient solutions
- constraint satisfaction
- exact algorithms
- single machine
- np complete
- np hard
- search algorithm
- variable neighborhood search
- combinatorial problems
- metaheuristic
- memetic algorithm
- job shop scheduling problem
- temporal logic
- max sat
- computational complexity
- phase transition
- vehicle routing problem
- multi objective
- benchmark instances
- path relinking
- search space