A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints.
Majid TaghaviKai HuangPublished in: Ann. Oper. Res. (2020)
Keyphrases
- lagrangian relaxation
- capacity expansion
- mixed integer programming
- budget constraints
- lower bound
- feasible solution
- branch and bound algorithm
- integer programming
- column generation
- dynamic programming
- linear programming
- distribution network
- np hard
- control policies
- shortest path
- production planning
- capacity planning
- lower and upper bounds