Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
From MaRDI portal
Publication:976324
DOI10.1016/j.ejor.2010.02.025zbMath1188.90189OpenAlexW2165620045MaRDI QIDQ976324
Lewis Ntaimo, Svyatoslav Trukhanov, Andrew J. Schaefer
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.025
Related Items (19)
Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study ⋮ Supply–demand hub in industrial clusters: a stochastic approach ⋮ Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs ⋮ Efficient Stochastic Programming in Julia ⋮ The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs ⋮ Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs ⋮ Multicut Benders decomposition algorithm for process supply chain planning under uncertainty ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ The Benders decomposition algorithm: a literature review ⋮ Benders decomposition for the Hazmat transport network design problem ⋮ A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management ⋮ An improved L-shaped method for solving process flexibility design problems ⋮ Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse ⋮ Liner ship bunkering and sailing speed planning with uncertain demand ⋮ Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse ⋮ A complementarity model for electric power transmission-distribution coordination under uncertainty ⋮ An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse ⋮ Large-scale unit commitment under uncertainty ⋮ Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
Uses Software
Cites Work
- Unnamed Item
- MSLiP: A computer code for the multistage stochastic linear programming problem
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Decomposition algorithms for stochastic programming on a computational grid
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Aggregation bounds in stochastic linear programming
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Introduction to Stochastic Programming
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
This page was built for publication: Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
