Strengthening the Lovász Theta(G) bound for graph coloring.
Philippe MeurdesoifPublished in: Math. Program. (2005)
Keyphrases
- graph coloring
- worst case
- combinatorial problems
- job shop scheduling
- np complete problems
- phase transition
- upper bound
- constraint satisfaction problems
- lower bound
- hamiltonian cycle
- max sat
- scheduling problem
- hyper heuristics
- tabu search
- artificial bee colony
- search procedure
- combinatorial optimization problems
- constraint satisfaction
- genetic programming
- dynamic programming