A Note on Iterated Rounding for the Survivable Network Design Problem.
Chandra ChekuriThapanapong RukkanchanuntPublished in: SOSA (2018)
Keyphrases
- network design problem
- approximation algorithms
- mixed integer
- benders decomposition
- np hard
- mixed integer programming
- special case
- valid inequalities
- feasible solution
- linear program
- worst case
- minimal cost
- branch and bound
- lot sizing
- cutting plane
- linear programming
- convex hull
- primal dual
- network design
- computationally expensive
- optimal solution
- objective function