Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis
From MaRDI portal
Publication:2084001
DOI10.1016/j.orl.2022.06.004OpenAlexW4293147269WikidataQ114143868 ScholiaQ114143868MaRDI QIDQ2084001
Publication date: 17 October 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.06.004
Related Items (3)
Exploiting the polyhedral geometry of stochastic linear bilevel programming ⋮ Exact Quantization of Multistage Stochastic Linear Problems ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A practical volume algorithm
- Triangulations. Structures for algorithms and applications
- Scenario reduction in stochastic programming
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- A note on scenario reduction for two-stage stochastic programs
- Introduction to Stochastic Programming
- On the Complexity of Computing the Volume of a Polyhedron
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
- Applications of Stochastic Programming
- An Adaptive Partition-Based Approach for Solving 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
This page was built for publication: Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis