Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
From MaRDI portal
(Redirected from Publication:976324)
Recommendations
- Adaptive multicut aggregation method for solving two-stage stochastic convex programming with recourse
- A multicut algorithm for two-stage stochastic linear programs
- Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- A multicut algorithm for two-stage stochastic linear programs
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Aggregation bounds in stochastic linear programming
- Decomposition algorithms for stochastic programming on a computational grid
- Introduction to Stochastic Programming
- MSLiP: A computer code for the multistage stochastic linear programming problem
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Partitioning procedures for solving mixed-variables programming problems
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
Cited in
(23)- A complementarity model for electric power transmission-distribution coordination under uncertainty
- Adaptive multicut aggregation method for solving two-stage stochastic convex programming with recourse
- Large-scale unit commitment under uncertainty: an updated literature survey
- Liner ship bunkering and sailing speed planning with uncertain demand
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
- The Benders decomposition algorithm: a literature review
- An asynchronous parallel benders decomposition method for stochastic network design problems
- Efficient Stochastic Programming in Julia
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- Supply–demand hub in industrial clusters: a stochastic approach
- Large-scale unit commitment under uncertainty
- Tight second stage formulations in two-stage stochastic mixed integer programs
- A multicut algorithm for two-stage stochastic linear programs
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
- An improved L-shaped method for solving process flexibility design problems
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
- Benders decomposition for the Hazmat transport network design problem
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
This page was built for publication: Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976324)
