Meta partial benders decomposition for the logistics service network design problem.
Simon BelieresMike HewittNicolas JozefowiezFrédéric SemetPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- benders decomposition
- network design problem
- network design
- approximation algorithms
- branch and bound
- mixed integer
- mixed integer programming
- minimal cost
- transportation networks
- integer programming
- lagrangian relaxation
- exact algorithms
- service level
- valid inequalities
- linear programming
- bayesian networks
- combinatorial optimization
- genetic algorithm
- supply chain