Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.
Markus ChimaniJoachim SpoerhasePublished in: CoRR (2014)
Keyphrases
- steiner tree
- network design problem
- facility location
- network design
- approximation algorithms
- branch and bound
- linear programming relaxation
- minimum spanning tree
- mixed integer
- lagrangian relaxation
- integer programming
- minimal cost
- shortest path
- valid inequalities
- transportation networks
- mixed integer programming
- lower bound
- column generation
- cutting plane
- ant colony optimization
- np hard