A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem.
Zhen YangHaoxun ChenFeng ChuPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- lagrangian relaxation
- capacity constraints
- facility location
- network design problem
- np hard
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- dynamic programming
- lower and upper bounds
- column generation
- linear programming
- mixed integer programming
- mixed integer program
- dual decomposition
- high dimensional
- single machine scheduling problem
- lagrangian heuristic
- special case
- branch and bound
- shortest path
- np complete
- relaxation algorithm
- optimal solution
- lot sizing
- minimum cost
- valid inequalities
- combinatorial optimization
- scheduling problem
- cutting plane algorithm
- lagrangian dual