Solving a Network Design Problem.
Alain ChabrierEmilie DannaClaude Le PapeLaurent PerronPublished in: Ann. Oper. Res. (2004)
Keyphrases
- network design problem
- network flow problem
- network design
- benders decomposition
- approximation algorithms
- branch and bound
- exact solution
- mixed integer programming
- minimal cost
- mixed integer
- transportation networks
- integer programming
- convex hull
- lp relaxation
- valid inequalities
- lagrangian relaxation
- network flow
- graphical models