Multi-commodity k-splittable survivable network design problems with relays.
Ozgur KabadurmusAlice E. SmithPublished in: Telecommun. Syst. (2016)
Keyphrases
- network design problem
- multi commodity
- heuristic solution
- network flow problem
- network design
- approximation algorithms
- branch and bound
- minimal cost
- mixed integer programming
- facility location
- integer programming
- transportation networks
- mixed integer
- lagrangian relaxation
- valid inequalities
- dynamic programming
- search algorithm
- social networks
- exact solution
- column generation
- convex hull
- np hard
- search space
- lower bound