Corrigendum: Lower Bounds for Rectilinear Steiner Trees.
Timothy Law SnyderPublished in: Inf. Process. Lett. (1991)
Keyphrases
- steiner tree
- lower bound
- linear programming relaxation
- upper bound
- branch and bound
- minimum spanning tree
- facility location
- branch and bound algorithm
- shortest path
- np hard
- lagrangian relaxation
- lower and upper bounds
- column generation
- knapsack problem
- optimal solution
- cutting plane
- objective function
- mixed integer programming
- linear programming
- integer programming
- worst case
- feasible solution
- multistage
- optimization problems
- neural network