A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations.
Halit ÜsterHomarjun AgrahariPublished in: Oper. Res. Lett. (2011)
Keyphrases
- benders decomposition
- network design problem
- network design
- approximation algorithms
- mixed integer
- branch and bound
- minimal cost
- mixed integer programming
- transportation networks
- valid inequalities
- integer programming
- probability distribution
- linear programming
- upper bound
- lagrangian relaxation
- joint distribution
- special case
- exact algorithms