Sciweavers

13 search results - page 2 / 3
» Dynamic Facility Location with Stochastic Demands
Sort
View
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 5 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
FOCS
2005
IEEE
13 years 11 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
13 years 11 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 ...
JSAC
2010
122views more  JSAC 2010»
13 years 3 months ago
Scalable service migration in autonomic network environments
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Konstantinos Oikonomou, Ioannis Stavrakakis
IOR
2008
137views more  IOR 2008»
13 years 5 months ago
Optimal Joint Inventory and Transshipment Control Under Uncertain Capacity
In this paper, we address the optimal joint control of inventory and transshipment for a firm that produces in two locations and faces capacity uncertainty. Capacity uncertainty (...
Xinxin Hu, Izak Duenyas, Roman Kapuscinski