On the hop-constrained survivable network design problem with reliable edges.
Quentin BottonBernard FortzLuis Eduardo Neves GouveiaPublished in: Comput. Oper. Res. (2015)
Keyphrases
- network design problem
- network design
- approximation algorithms
- benders decomposition
- branch and bound
- minimal cost
- mixed integer
- mixed integer programming
- transportation networks
- integer programming
- lagrangian relaxation
- lower bound
- np hard
- objective function
- markov random field
- upper bound
- valid inequalities
- optimal solution