Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126].
Martine LabbéEdward F. SchmeichelS. Louis HakimiPublished in: Oper. Res. Lett. (1996)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- facility location problem
- special case
- vertex cover
- worst case
- minimum cost
- set cover
- primal dual
- optimal solution
- approximation schemes
- randomized algorithms
- open shop
- precedence constraints
- np hardness
- computational complexity
- approximation ratio
- facility location
- routing problem
- knapsack problem
- branch and bound algorithm
- scheduling problem
- lot sizing
- vehicle routing problem
- constant factor
- linear programming
- lower bound
- integer programming
- polynomial time approximation
- disjoint paths
- constant factor approximation