LP-based approximation algorithms for capacitated facility location.
Retsef LeviDavid B. ShmoysChaitanya SwamyPublished in: Math. Program. (2012)
Keyphrases
- facility location
- approximation algorithms
- np hard
- integer programming
- multi commodity
- linear programming
- mixed integer
- facility location problem
- primal dual
- lagrangian relaxation
- linear program
- special case
- network design
- optimal solution
- vertex cover
- network design problem
- minimum cost
- lp relaxation
- lower bound
- valid inequalities
- lot sizing
- worst case
- scheduling problem
- approximation ratio
- cutting plane
- constant factor approximation
- multi criteria
- constant factor
- np complete
- constraint satisfaction problems
- network flow problem
- column generation
- network flow
- production planning
- combinatorial auctions
- knapsack problem
- dynamic programming
- computational complexity
- feasible solution
- integrality gap