A branch and bound algorithm for the capacitated minimum spanning tree problem.
Kavindra MalikGang YuPublished in: Networks (1993)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- optimal solution
- upper bound
- np hard
- test problems
- combinatorial optimization
- lower bounding
- search tree
- lagrangian relaxation
- neighborhood structure
- variable ordering
- randomly generated problems
- branch and bound method
- mixed integer linear programming
- upper bounding
- spanning tree
- precedence constraints
- minimum spanning tree
- search space
- maximum clique
- single machine scheduling problem
- max sat
- integer programming
- scheduling problem
- search algorithm