Benders decomposition for the Hazmat Transport Network Design Problem.
Pirmin FontaineStefan MinnerPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- benders decomposition
- network design problem
- lagrangian relaxation
- network design
- approximation algorithms
- branch and bound
- integer programming
- mixed integer
- mixed integer programming
- minimal cost
- transportation networks
- lower bound
- column generation
- lower and upper bounds
- linear programming
- branch and bound algorithm
- feasible solution
- dynamic programming
- valid inequalities
- upper bound