Solving the multi-capacitated location problem using a Lagrangian relaxation approach.
Mohammed El AmraniYoussef BenadadaPublished in: GOL (2018)
Keyphrases
- lagrangian relaxation
- capacity constraints
- facility location
- network design problem
- np hard
- mixed integer program
- integer programming
- subgradient method
- feasible solution
- column generation
- linear programming
- branch and bound algorithm
- lower and upper bounds
- lower bound
- lagrangian dual
- branch and bound search
- lagrangian heuristic
- dynamic programming
- dual decomposition
- relaxation algorithm
- dual variables
- linear programming problems
- upper bound
- shortest path
- mixed integer linear programs
- mixed integer programming
- lp relaxation
- integer program
- combinatorial optimization
- special case
- nonlinear programming
- cutting plane algorithm
- optimization problems
- lot sizing
- linear program
- multi objective