A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem.
Jun HanGraham McMahonStephen SugdenPublished in: LCN (2003)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- optimal solution
- test problems
- lower bounding
- precedence constraints
- mixed integer linear programming
- upper bounding
- combinatorial optimization
- randomly generated problems
- search tree
- max sat
- branch and bound method
- lagrangian relaxation
- single machine scheduling problem
- finding an optimal solution
- variable ordering
- maximum clique
- integer variables
- column generation
- shortest path
- linear programming
- scheduling problem
- special case
- search algorithm