A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation.
Qingning ShenFeng ChuHaoxun ChenPublished in: Comput. Chem. Eng. (2011)
Keyphrases
- lagrangian relaxation
- crude oil
- integer programming
- np hard
- linear programming
- oil field
- dual decomposition
- column generation
- cutting plane
- feasible solution
- constraint programming
- lower bound
- network design problem
- dynamic programming
- relaxation algorithm
- branch and bound algorithm
- network flow
- cutting plane algorithm
- special case
- long run
- analytical model
- neural network
- training data
- search algorithm
- transportation networks
- long term
- upper bound