Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands.
Andreas S. SchulzClaudio TelhaPublished in: ESA (2011)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- constant factor
- vertex cover
- special case
- minimum cost
- facility location problem
- approximation schemes
- primal dual
- np complete
- randomized algorithms
- network design problem
- exact algorithms
- lower bound
- precedence constraints
- approximation ratio
- greedy heuristic
- integer programming
- knapsack problem
- greedy algorithm
- resource allocation
- scheduling problem
- optimal solution
- open shop