Exact Quantization of Multistage Stochastic Linear Problems
From MaRDI portal
Publication:6188513
DOI10.1137/22m1508005arXiv2107.09566WikidataQ128650469 ScholiaQ128650469MaRDI QIDQ6188513
Stéphane Gaubert, Vincent Leclère, Maël Forcier
Publication date: 7 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09566
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comment on ``Computational complexity of stochastic programming problems
- Bounds in multistage linear stochastic programming
- Analysis of stochastic dual dynamic programming method
- Duality and minors of secondary polyhedra
- Normal fans of polyhedral convex sets
- Integer points in polyhedra
- Triangulations. Structures for algorithms and applications
- Multi-stage stochastic optimization applied to energy planning
- Fiber polytopes
- Variation of cost functions in integer programming
- Scenario reduction in stochastic programming
- Projections of polytopes and the generalized Baues conjecture
- Scenario reduction algorithms in stochastic programming
- Generalized bounds for convex multistage stochastic programs.
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
- Simple formula for integration of polynomials on a simplex
- Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis
- Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
- Complexity of stochastic dual dynamic programming
- Computational complexity of stochastic programming problems
- Measuring solid angles beyond dimension three
- Lifting projections of convex polyhedra
- A Distance For Multistage Stochastic Optimization Models
- Introduction to Stochastic Programming
- Integer Programming with a Fixed Number of Variables
- Polytope Volume Computation
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Points entiers dans les polyèdres convexes
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- On the Complexity of Familiar Functions and Numbers
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- The maximum numbers of faces of a convex polytope
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
This page was built for publication: Exact Quantization of Multistage Stochastic Linear Problems
