Improved branch-and-bound algorithm for U-curve optimization.
Esmaeil Atashpaz-GargariUlisses M. Braga-NetoEdward R. DoughertyPublished in: GENSiPS (2013)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- lower bound
- branch and bound
- randomly generated
- upper bound
- optimal solution
- lower bounding
- test problems
- search tree
- np hard
- precedence constraints
- randomly generated problems
- optimization problems
- upper bounding
- optimization algorithm
- lagrangian relaxation
- single machine scheduling problem
- mixed integer linear programming
- branch and bound method
- maximum clique
- column generation
- variable ordering
- traveling salesman problem
- max sat
- cutting plane
- high dimensional