An efficient approximation algorithm for the survivable network design problem.
Harold N. GabowMichel X. GoemansDavid P. WilliamsonPublished in: Math. Program. (1998)
Keyphrases
- network design problem
- network design
- approximation algorithms
- benders decomposition
- branch and bound
- minimal cost
- mixed integer programming
- transportation networks
- mixed integer
- integer programming
- lagrangian relaxation
- valid inequalities
- column generation
- special case
- communication networks
- lp relaxation
- traveling salesman problem