Heuristics for the Survivable Network Design Problem.
Chi-Geun HanTae-Ju LeePublished in: International Conference on Internet Computing (2000)
Keyphrases
- network design problem
- heuristic solution
- approximation algorithms
- network design
- branch and bound
- benders decomposition
- transportation networks
- minimal cost
- mixed integer programming
- integer programming
- valid inequalities
- mixed integer
- search algorithm
- lagrangian relaxation
- exact algorithms
- heuristic search
- linear programming
- exact solution
- branch and bound algorithm
- search space
- lower bound