Abstract
In this article we propose, for any $\varepsilon$ > 0, a 2(1 + $\varepsilon$)-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 | English |
---|---|
Title of host publication | Algorithmic Applications in Management |
Subtitle of host publication | First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings |
Editors | Nimrod Megiddo, Yinfeng Xu, Binhai Zhu |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 330-339 |
Number of pages | 10 |
ISBN (Electronic) | 978-3-540-32440-9 |
ISBN (Print) | 978-3-540-26224-4 |
DOIs | |
Publication status | Published - 2005 |
Event | 1st International Conference on Algorithmic Applications in Management, AAIM 2005 - Xi'an, China Duration: 22 Jun 2005 → 25 Jun 2005 Conference number: 1 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 3521 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 1st International Conference on Algorithmic Applications in Management, AAIM 2005 |
---|---|
Abbreviated title | AAIM |
Country/Territory | China |
City | Xi'an |
Period | 22/06/05 → 25/06/05 |
Keywords
- MSC-90B06
- MSC-68W25
- METIS-224180
- MSC-60K30
- EWI-9603
- IR-63983
- Approximation algorithms
- Stochastic facility location