An approximation algorithm for a facility location problem with inventories and stochastic demands

A.F. Bumb, J.C.W. Ommeren, van

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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. AMS Classification: 68W25, 90B06, 60K30.
Original languageEnglish
Title of host publicationAlgorithmic Applications in Management
Subtitle of host publicationFirst International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings
EditorsN. Megiddo, Yinfeng Xu, Binhai Zhu
Place of PublicationBerlin
PublisherSpringer
Chapter36
Pages330-339
Number of pages10
ISBN (Electronic)978-3-540-32440-9
ISBN (Print)3-540-26224-5, 978-3-540-26224-4
DOIs
Publication statusPublished - 2005

Publication series

NameLecture Notes in Computer Science (LNCS)
Volume3521
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'An approximation algorithm for a facility location problem with inventories and stochastic demands'. Together they form a unique fingerprint.

  • Cite this

    Bumb, A. F., & Ommeren, van, J. C. W. (2005). An approximation algorithm for a facility location problem with inventories and stochastic demands. In N. Megiddo, Y. Xu, & B. Zhu (Eds.), Algorithmic Applications in Management : First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings (pp. 330-339). (Lecture Notes in Computer Science (LNCS); Vol. 3521). Springer. https://doi.org/10.1007/11496199_36