Improved Algorithm for Degree Bounded Survivable Network Design Problem.
Anand LouisNisheeth K. VishnoiPublished in: SWAT (2010)
Keyphrases
- network design problem
- improved algorithm
- network design
- approximation algorithms
- benders decomposition
- branch and bound
- minimal cost
- transportation networks
- mixed integer programming
- integer programming
- mixed integer
- lagrangian relaxation
- valid inequalities
- lower bound
- road network
- branch and bound algorithm
- np hard
- search algorithm
- genetic algorithm