An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem.
Ali DiabatOlga BattaïaDima NazzalPublished in: Comput. Oper. Res. (2015)
Keyphrases
- lagrangian relaxation
- facility location
- integer programming
- feasible solution
- lower and upper bounds
- dynamic programming
- lower bound
- column generation
- linear programming
- branch and bound algorithm
- mixed integer programming
- np hard
- lagrangian heuristic
- mixed integer program
- network design problem
- relaxation algorithm
- randomly generated test problems
- setup times
- dual decomposition
- set covering problem
- branch and bound
- tabu search
- lot sizing
- supply chain
- branch and bound search
- valid inequalities
- objective function
- subgradient method
- cutting plane algorithm
- optimal solution
- search algorithm
- upper bound
- lead time
- single machine scheduling problem
- multidimensional knapsack problem
- infinite horizon
- shortest path
- multistage
- linear program