Improved Algorithm for Degree Bounded Survivable Network Design Problem
Anand LouisNisheeth K. VishnoiPublished in: CoRR (2009)
Keyphrases
- network design problem
- improved algorithm
- approximation algorithms
- network design
- benders decomposition
- branch and bound
- mixed integer programming
- minimal cost
- mixed integer
- transportation networks
- integer programming
- valid inequalities
- upper bound
- np hard
- lagrangian relaxation
- neural network
- worst case
- bayesian networks
- lower bound
- exact solution
- traveling salesman problem
- combinatorial optimization