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 well-studied optimization problems (such as Steiner tree, Vertex Cover, and Facility Location, to name but a few) presents new challenges when investigated in this framework, which has promoted much research in approximation algorithms. There has been much interest in optimization problems in the setting of two-stage stochastic optimization with recourse, which can be paraphrased as follows: On the first day (Monday), we know a probability distribution π from which client demands will be drawn on Tuesday, and are allowed to make preliminary investments (e.g., installing links, opening facilities) towards meeting this future demand. On Tuesday, the actual requirements are revealed (drawn from the same distribution π) and we must purchase enough additional equipment to satisfy these demands; however, these ...

• Type: Conference
• Year: 2005
• Where: APPROX
• Authors: Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
• Keywords: Algorithms, APPROX 2005, Approximation Algorithms, Optimization Problem, Stochastic Optimization