Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.
Quentin BottonBernard FortzLuis Eduardo Neves GouveiaMichael PossPublished in: INFORMS J. Comput. (2013)
Keyphrases
- network design problem
- benders decomposition
- network design
- approximation algorithms
- branch and bound
- mixed integer
- mixed integer programming
- transportation networks
- minimal cost
- integer programming
- lagrangian relaxation
- valid inequalities
- linear programming
- lower bound
- communication networks
- road network
- feasible solution