A branch-and-price approach to the feeder network design problem.
Alberto SantiniChristian E. M. PlumStefan RopkePublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- network design problem
- network design
- approximation algorithms
- benders decomposition
- branch and bound
- mixed integer programming
- minimal cost
- transportation networks
- lagrangian relaxation
- mixed integer
- lagrangian heuristic
- valid inequalities
- integer programming
- np hard
- special case
- lot sizing
- upper bound
- search algorithm