Solving a stochastic inventory-location problem using Lagrangian relaxation approach.
Guy-Aimé TanonkouLyès BenyoucefRaymond BisdorffXiaolan XiePublished in: CASE (2005)
Keyphrases
- lagrangian relaxation
- integer programming
- subgradient method
- lower bound
- lagrangian dual
- linear programming
- lower and upper bounds
- feasible solution
- branch and bound algorithm
- column generation
- dynamic programming
- np hard
- mixed integer programming
- integer program
- upper bound
- dual variables
- shortest path
- multi item
- stochastic inventory
- branch and bound