A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note).
Jun HanGraham McMahonStephen SugdenPublished in: Euro-Par (2002)
Keyphrases
- branch and bound algorithm
- branch and bound
- lower bound
- upper bound
- lower bounding
- optimal solution
- test problems
- combinatorial optimization
- precedence constraints
- np hard
- search tree
- neighborhood structure
- randomly generated problems
- upper bounding
- lagrangian relaxation
- finding an optimal solution
- max sat
- minimum spanning tree
- spanning tree
- branch and bound method
- mixed integer linear programming
- variable ordering
- single machine scheduling problem
- lower and upper bounds
- linear programming
- search space
- search algorithm