Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type.
Joseph B. MazzolaAlan W. NeebePublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- np hard
- feasible solution
- lagrangian heuristic
- column generation
- branch and bound algorithm
- dynamic programming
- network design problem
- production planning
- mixed integer programming
- linear programming
- lower and upper bounds
- capacity constraints
- dual decomposition
- subgradient method
- shortest path
- single machine scheduling problem
- mixed integer linear programs
- neural network
- branch and bound
- np complete