Approximation algorithms for the capacitated plant allocation problem.
Martine LabbéEdward F. SchmeichelS. Louis HakimiPublished in: Oper. Res. Lett. (1994)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- facility location problem
- special case
- vertex cover
- minimum cost
- np hardness
- worst case
- scheduling problem
- linear programming
- approximation schemes
- approximation ratio
- open shop
- randomized algorithms
- branch and bound algorithm
- routing problem
- primal dual
- lower bound
- optimal solution
- vehicle routing problem
- precedence constraints
- set cover
- computational complexity
- lot sizing
- combinatorial auctions
- constant factor
- integer programming
- branch and bound
- combinatorial optimization
- integrality gap
- constant factor approximation