A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty.
Amit Kumar VatsaSachin JayaswalPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- multi period
- facility location problem
- mixed integer
- facility location
- approximation algorithms
- network design problem
- lot sizing
- linear program
- convex hull
- planning horizon
- valid inequalities
- optimal solution
- cutting plane
- mixed integer programming
- lp relaxation
- feasible solution
- continuous variables
- routing problem
- worst case
- production planning
- total cost
- knapsack problem
- multistage
- multi item
- np hard
- reinforcement learning