Safe Lower Bounds for Graph Coloring.
Stephan HeldWilliam J. CookEdward C. SewellPublished in: IPCO (2011)
Keyphrases
- graph coloring
- lower bound
- max sat
- branch and bound algorithm
- combinatorial problems
- upper bound
- branch and bound
- np complete problems
- job shop scheduling
- np hard
- scheduling problem
- phase transition
- constraint satisfaction problems
- worst case
- optimal solution
- objective function
- distributed constraint optimization problems
- randomly generated
- constraint programming
- constraint satisfaction
- metaheuristic
- combinatorial optimization
- decision problems
- tabu search
- search space
- search algorithm