Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.
Markus ChimaniJoachim SpoerhasePublished in: STACS (2015)
Keyphrases
- steiner tree
- network design problem
- facility location
- network design
- mixed integer
- approximation algorithms
- linear programming relaxation
- mixed integer programming
- branch and bound
- integer programming
- lagrangian relaxation
- minimum spanning tree
- shortest path
- valid inequalities
- minimal cost
- transportation networks
- feasible solution
- optimal solution
- communication networks
- computational complexity