Sciweavers

6 search results - page 1 / 2
» Stochastic facility location with general long-run costs and...
Sort
View
COR
2008
101views more  COR 2008»
13 years 4 months ago
Stochastic facility location with general long-run costs and convex short-run costs
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
Peter Schütz, Leen Stougie, Asgeir Tomasgard
MSOM
2008
103views more  MSOM 2008»
13 years 4 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 6 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
13 years 10 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 6 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen