A new formulation for the liner shipping network design problem.
Marie AmelnJulie Sand FuglumKristian ThunHenrik AnderssonMagnus StålhanePublished in: Int. Trans. Oper. Res. (2021)
Keyphrases
- network design problem
- heuristic solution
- mixed integer
- valid inequalities
- benders decomposition
- network design
- approximation algorithms
- integer programming
- mixed integer programming
- transportation networks
- branch and bound
- feasible solution
- lp relaxation
- minimal cost
- linear programming
- lagrangian relaxation
- np hard
- lower and upper bounds
- integer program
- primal dual
- cutting plane
- neural network
- travel time
- knapsack problem
- road network
- convex hull
- linear program
- worst case
- optimal solution