Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Authors:
- D.B. ShmoysDSD.B. Shmoys
- C. SwamyCSC. Swamy
- 23 December 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 228-237
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Computational complexity of stochastic programming problemsMathematical Programming, 2005
- Boosted sampling2004
- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization ProblemsLecture Notes in Computer Science, 2004
- The stochastic single resource service‐provision problemNaval Research Logistics (NRL), 2003
- The Sample Average Approximation Method for Stochastic Discrete OptimizationSIAM Journal on Optimization, 2002
- Tight approximation results for general covering integer programs2001
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- Geometric Algorithms and Combinatorial Optimization1988
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Linear Programming under UncertaintyManagement Science, 1955