A new convergent hybrid learning algorithm for two-stage stochastic programs
From MaRDI portal
Publication:2286915
DOI10.1016/j.ejor.2019.11.001zbMath1431.90105OpenAlexW2983433598WikidataQ126829439 ScholiaQ126829439MaRDI QIDQ2286915
Ning Shi, Fan Wang, Hui Zhang, Zhou Xu, Shaorui Zhou
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.001
Related Items
Inventory pooling and pricing decisions in multiple markets with strategic customers, A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Stochastic network models for logistics planning in disaster relief
- Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
- Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures
- Analysis of stochastic dual dynamic programming method
- On the convergence of stochastic dual dynamic programming and related methods
- Partitioning procedures for solving mixed-variables programming problems
- Multi-stage stochastic optimization applied to energy planning
- Cut sharing for multistage stochastic linear programs with interstage dependency
- A two-stage stochastic programming approach for multi-activity tour scheduling
- An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains
- The sample average approximation method for empty container repositioning with uncertainties
- Risk neutral and risk averse stochastic dual dynamic programming method
- SDDP for some interstage dependent risk-averse problems and application to hydro-thermal planning
- A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management
- Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs
- Sampling-Based Decomposition Methods for Multistage Stochastic Programs Based on Extended Polyhedral Risk Measures
- A Linearization Method for Nonsmooth Stochastic Programming Problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Acceleration of Stochastic Approximation by Averaging
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- Inexact Cuts in Benders Decomposition
- Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
- Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming
- On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs
- An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
- Applications of Stochastic Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
- A Stochastic Approximation Method
