Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees.
J. Hyam RubinsteinJia F. WengNicholas C. WormaldPublished in: J. Glob. Optim. (2006)
Keyphrases
- steiner tree
- lower bound
- linear programming relaxation
- upper bound
- minimum spanning tree
- arc length
- facility location
- branch and bound algorithm
- shortest path
- objective function
- branch and bound
- lower and upper bounds
- optimal solution
- euclidean distance
- vc dimension
- np hard
- euclidean space
- knapsack problem
- lagrangian relaxation
- worst case
- genetic algorithm
- column generation
- multi objective