Approximation Algorithms for 2-Stage Stochastic Optimization Problems

DOI10.1007/11944836_3zbMath1177.90302OpenAlexW1485319919MaRDI QIDQ5385968

David B. Shmoys, Chaitanya Swamy

Publication date: 17 April 2008

Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11944836_3

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items

Approximation algorithms for stochastic combinatorial optimization problems, Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points, Location of Emergency Facilities with Uncertainty in the Demands, Online network design with outliers, The min-p robust optimization approach for facility location problem under uncertainty, Stochastic models for budget optimization in search-based advertising, Approximation algorithms for \(k\)-level stochastic facility location problems, Universal Algorithms for Clustering Problems, Approximation Algorithms for Stochastic and Risk-Averse Optimization, Decomposition methods for the two-stage stochastic Steiner tree problem, When LP is the cure for your matching woes: improved bounds for stochastic matchings, Probabilistic models for the Steiner Tree problem

Uses Software

• SUTIL