Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization
From MaRDI portal
Publication:3143299
DOI10.1137/100789269zbMath1253.68379OpenAlexW2043459466MaRDI QIDQ3143299
Chaitanya Swamy, David B. Shmoys
Publication date: 29 November 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1290/
Analysis of algorithms (68W40) Convex programming (90C25) Linear programming (90C05) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (10)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ K-Adaptability in Two-Stage Robust Binary Programming ⋮ Universal Algorithms for Clustering Problems ⋮ Configuration balancing for stochastic requests ⋮ Approximation Algorithms for Stochastic and Risk-Averse Optimization ⋮ Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States ⋮ Offline and online facility leasing ⋮ Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
This page was built for publication: Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization
