On the Polytope of the (1, 2)-Survivable Network Design Problem.
Mohamed Didi BihaHervé KerivinAli Ridha MahjoubPublished in: SIAM J. Discret. Math. (2008)
Keyphrases
- network design problem
- valid inequalities
- convex hull
- network design
- mixed integer
- approximation algorithms
- benders decomposition
- branch and bound
- mixed integer programming
- integer programming
- minimal cost
- transportation networks
- linear programming
- cutting plane
- feasible solution
- primal dual
- integer variables
- lagrangian heuristic
- lower and upper bounds
- mathematical model
- lower bound