Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems.
Anantaram BalakrishnanThomas L. MagnantiPrakash MirchandaniPublished in: Oper. Res. Lett. (2001)
Keyphrases
- network design problem
- worst case analysis
- approximation algorithms
- network design
- network flow problem
- worst case
- mixed integer
- mixed integer programming
- average case
- integer programming
- lagrangian relaxation
- linear programming relaxation
- branch and bound
- np hardness
- minimal cost
- transportation networks
- feasible solution
- valid inequalities
- exact solution
- communication networks
- greedy heuristic
- optimal solution
- column generation
- branch and bound algorithm
- lower bound