Lagrangian relaxation for distribution networks with cross-docking centre.
Manpreet Singh BhanguRimmi AnandVijay KumarPublished in: Int. J. Intell. Syst. Technol. Appl. (2019)
Keyphrases
- lagrangian relaxation
- distribution networks
- integer programming
- feasible solution
- lower bound
- column generation
- dynamic programming
- branch and bound algorithm
- linear programming
- lower and upper bounds
- capacity constraints
- dual decomposition
- lead time
- np hard
- network design problem
- shortest path
- mixed integer program
- upper bound
- relaxation algorithm
- lagrangian dual
- subgradient method
- linear program
- single machine scheduling problem
- lagrangian heuristic
- branch and bound
- tabu search