A Note on Lower Bounds for Rectilinear Steiner Trees.
Jeffrey S. SalowePublished in: Inf. Process. Lett. (1992)
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
- objective function
- linear programming
- knapsack problem
- lower and upper bounds
- optimal solution
- worst case
- neural network
- integer programming
- lagrangian relaxation
- genetic algorithm
- valid inequalities
- mixed integer programming
- computational complexity
- column generation
- approximation algorithms
- feasible solution