Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Optimal control of service for facility holding inventory
Computers and Operations Research
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Facility location and the analysis of algorithms through factor-revealing programs
Facility location and the analysis of algorithms through factor-revealing programs
Theoretical Computer Science - Algorithmic applications in management
Hi-index | 0.00 |
In this article we propose, for any ε 0, a 2(1 + ε)-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The incurred costs are the expected transportation costs from the demand points to the facilities, the operating costs of the facilities and the investment in inventory. AMS Classification: 68W25, 90B06, 60K30.