A note on the Survivable Network Design Problem.
Chandra ChekuriThapanapong RukkanchanuntPublished in: CoRR (2016)
Keyphrases
- network design problem
- approximation algorithms
- network design
- benders decomposition
- branch and bound
- minimal cost
- mixed integer programming
- mixed integer
- transportation networks
- lagrangian relaxation
- integer programming
- optimal solution
- valid inequalities
- special case
- column generation
- communication networks
- np hard
- search space
- neural network