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

Adriana F. Bumb, Jan Kees C.W. Van Ommeren

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

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 languageBritish English
Pages (from-to)330-339
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3521
DOIs
StatePublished - 2005
EventFirst International Conference on Algorithmic Applications in Management, AAIM 2005 - Xian, China
Duration: 22 Jun 200525 Jun 2005

Keywords

  • Approximation algorithms
  • Stochastic facility location

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