Applying Lagrangian relaxation to the resolution of two-stage location problems.
Alfredo MarínBlas PelegrínPublished in: Ann. Oper. Res. (1999)
Keyphrases
- location problems
- lagrangian relaxation
- single facility
- integer programming
- lower bound
- feasible solution
- column generation
- branch and bound algorithm
- linear programming
- lower and upper bounds
- dual decomposition
- np hard
- dynamic programming
- relaxation algorithm
- bicriteria
- lagrangian heuristic
- shortest path
- cutting plane algorithm
- single machine scheduling problem
- subgradient method
- valid inequalities
- lagrangian dual