Meta Partial Benders Decomposition for the Logistics Service Network Design Problem.
Simon BelieresMike HewittNicolas JozefowiezFrédéric SemetPublished in: CoRR (2020)
Keyphrases
- benders decomposition
- network design problem
- network design
- approximation algorithms
- branch and bound
- mixed integer
- minimal cost
- mixed integer programming
- transportation networks
- integer programming
- service level
- optimal solution
- lagrangian relaxation
- exact algorithms
- mathematical model
- valid inequalities
- upper bound
- special case