An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem.
Fabio FuriniVirginie GabrelIan-Christopher TernierPublished in: Networks (2017)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- optimal solution
- lower bounding
- test problems
- np hard
- undirected graph
- precedence constraints
- upper bound
- combinatorial optimization
- single machine scheduling problem
- search tree
- randomly generated problems
- mixed integer linear programming
- upper bounding
- branch and bound method
- variable ordering
- maximum clique
- lagrangian relaxation
- max sat
- integer variables
- search algorithm
- finding an optimal solution
- special case
- column generation
- bayesian networks
- mathematical programming
- particle swarm optimization
- optimization problems
- knn
- dynamic programming