A Lagrangian Relaxation Heuristic Approach for Coordinated Global Intermodal Transportation.
Wenjing GuoRudy R. NegenbornBilge AtasoyPublished in: CASE (2022)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- dynamic programming
- column generation
- branch and bound algorithm
- lower and upper bounds
- linear programming
- np hard
- mixed integer program
- mixed integer programming
- lagrangian heuristic
- dual decomposition
- shortest path
- setup times
- single machine scheduling problem
- network design problem
- optimal solution
- multidimensional knapsack problem
- objective function
- randomly generated test problems
- branch and bound
- tabu search
- mixed integer linear programs
- subgradient method
- neural network
- np complete
- transportation networks
- set covering problem