Maximum-weight stable sets and safe lower bounds for graph coloring.
Stephan HeldWilliam J. CookEdward C. SewellPublished in: Math. Program. Comput. (2012)
Keyphrases
- graph coloring
- lower bound
- maximum weight
- max sat
- combinatorial problems
- np hard
- branch and bound algorithm
- upper bound
- job shop scheduling
- branch and bound
- bipartite graph
- scheduling problem
- minimum weight
- constraint satisfaction problems
- partial order
- weighted graph
- optimal solution
- phase transition
- objective function
- search algorithm
- constraint programming
- hyper heuristics
- linear programming
- simulated annealing
- swarm intelligence
- worst case
- bin packing
- data structure
- constraint satisfaction