An algorithm for the capacitated, multi-commodity multi-period facility location problem.
Cem CanelBasheer M. KhumawalaJaphett LawAnthony LohPublished in: Comput. Oper. Res. (2001)
Keyphrases
- facility location problem
- multi period
- facility location
- multi commodity
- np hard
- approximation algorithms
- routing problem
- dynamic programming
- multi item
- computational complexity
- worst case
- objective function
- network design
- lagrangian relaxation
- max min
- cost function
- integer programming
- special case
- simulated annealing
- benchmark problems
- minimal cost
- network flow problem