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

Adriana F. Bumb; Jan-Kees C.W. van Ommeren

doi:10.1007/11496199_36

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

Adriana F. Bumb
, Jan-Kees C.W. van Ommeren

Stochastic Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

19 Downloads (Pure)

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	https://doi.org/10.1007/11496199_36
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

Access to Document

10.1007/11496199_36

Cite this

Bumb, A. F., & van Ommeren, J.-K. 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; Vol. 3521). Springer. https://doi.org/10.1007/11496199_36

Bumb, Adriana F. ; van Ommeren, Jan-Kees C.W. / An approximation algorithm for a facility location problem with inventories and stochastic demands. Algorithmic Applications in Management: First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings. editor / Nimrod Megiddo ; Yinfeng Xu ; Binhai Zhu. Berlin, Heidelberg : Springer, 2005. pp. 330-339 (Lecture Notes in Computer Science).

@inproceedings{03f9b53f2e2d48ba8acc17737db1c37c,

title = "An approximation algorithm for a facility location problem with inventories and stochastic demands",

abstract = "In this article we propose, for any \$\textbackslash{}varepsilon\$ > 0, a 2(1 + \$\textbackslash{}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.",

keywords = "MSC-90B06, MSC-68W25, METIS-224180, MSC-60K30, EWI-9603, IR-63983, Approximation algorithms, Stochastic facility location",

author = "Bumb, \{Adriana F.\} and \{van Ommeren\}, \{Jan-Kees C.W.\}",

year = "2005",

doi = "10.1007/11496199\_36",

language = "English",

isbn = "978-3-540-26224-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "330--339",

editor = "Nimrod Megiddo and Yinfeng Xu and Binhai Zhu",

booktitle = "Algorithmic Applications in Management",

address = "Germany",

note = "1st International Conference on Algorithmic Applications in Management, AAIM 2005, AAIM ; Conference date: 22-06-2005 Through 25-06-2005",

}

Bumb, AF & van Ommeren, J-KCW 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. Lecture Notes in Computer Science, vol. 3521, Springer, Berlin, Heidelberg, pp. 330-339, 1st International Conference on Algorithmic Applications in Management, AAIM 2005, Xi'an, China, 22/06/05. https://doi.org/10.1007/11496199_36

An approximation algorithm for a facility location problem with inventories and stochastic demands. / Bumb, Adriana F.; van Ommeren, Jan-Kees C.W.
Algorithmic Applications in Management: First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings. ed. / Nimrod Megiddo; Yinfeng Xu; Binhai Zhu. Berlin, Heidelberg: Springer, 2005. p. 330-339 (Lecture Notes in Computer Science; Vol. 3521).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Bumb, Adriana F.

AU - van Ommeren, Jan-Kees C.W.

N1 - Conference code: 1

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - MSC-90B06

KW - MSC-68W25

KW - METIS-224180

KW - MSC-60K30

KW - EWI-9603

KW - IR-63983

KW - Approximation algorithms

KW - Stochastic facility location

U2 - 10.1007/11496199_36

DO - 10.1007/11496199_36

M3 - Conference contribution

SN - 978-3-540-26224-4

T3 - Lecture Notes in Computer Science

SP - 330

EP - 339

BT - Algorithmic Applications in Management

A2 - Megiddo, Nimrod

A2 - Xu, Yinfeng

A2 - Zhu, Binhai

PB - Springer

CY - Berlin, Heidelberg

T2 - 1st International Conference on Algorithmic Applications in Management, AAIM 2005

Y2 - 22 June 2005 through 25 June 2005

ER -

Bumb AF, van Ommeren JKCW. An approximation algorithm for a facility location problem with inventories and stochastic demands. In Megiddo N, Xu Y, Zhu B, editors, Algorithmic Applications in Management: First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings. Berlin, Heidelberg: Springer. 2005. p. 330-339. (Lecture Notes in Computer Science). doi: 10.1007/11496199_36

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

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this