A comment on ``Computational complexity of stochastic programming problems
From MaRDI portal
Publication:312699
DOI10.1007/s10107-015-0958-2zbMath1345.90063OpenAlexW2069737635MaRDI QIDQ312699
Daniel Kuhn, Wolfram Wiesemann, Grani A. Hanasusanto
Publication date: 16 September 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/38437
Related Items (27)
Regularization via Mass Transportation ⋮ Piecewise static policies for two-stage adjustable robust linear optimization ⋮ The stochastic bilevel continuous knapsack problem with uncertain follower's objective ⋮ Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ Discrete Optimal Transport with Independent Marginals is #P-Hard ⋮ Compromise policy for multi-stage stochastic linear programming: variance and bias reduction ⋮ Exact Quantization of Multistage Stochastic Linear Problems ⋮ Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs ⋮ Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets ⋮ Unnamed Item ⋮ The Distributionally Robust Chance-Constrained Vehicle Routing Problem ⋮ Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms ⋮ Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming ⋮ Stochastic joint homecare service and capacity planning with nested decomposition approaches ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations ⋮ Tutorial on risk neutral, distributionally robust and risk averse multistage stochastic programming ⋮ Building disaster preparedness and response capacity in humanitarian supply chains using the social vulnerability index ⋮ Quality evaluation of scenario-tree generation methods for solving stochastic programming problems ⋮ A stochastic primal-dual method for optimization with conditional value at risk constraints ⋮ Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls ⋮ On the Scenario-Tree Optimal-Value Error for Stochastic Programming Problems ⋮ Worst-Case Expected Shortfall with Univariate and Bivariate Marginals ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Two-stage linear decision rules for multi-stage stochastic programming ⋮ A stability result for linear Markovian stochastic optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On inverses of Vandermonde and confluent Vandermonde matrices
- Counting linear extensions
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
- Computational complexity of stochastic programming problems
- On the Complexity of Computing the Volume of a Polyhedron
- Introduction to Stochastic Programming
- A Primer on Statistical Distributions
This page was built for publication: A comment on ``Computational complexity of stochastic programming problems
