Abstract
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.
| Original language | British English |
|---|---|
| Pages (from-to) | 330-339 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3521 |
| DOIs | |
| State | Published - 2005 |
| Event | First International Conference on Algorithmic Applications in Management, AAIM 2005 - Xian, China Duration: 22 Jun 2005 → 25 Jun 2005 |
Keywords
- Approximation algorithms
- Stochastic facility location