Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
From MaRDI portal
Publication:2288987
DOI10.1007/s10479-017-2689-7zbMath1435.90095OpenAlexW2767131998MaRDI QIDQ2288987
Yongjia Song, Babak Saleck Pay
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2689-7
benders decompositionpartition-based algorithmcontinuous recoursetwo-stage stochastic integer program
Related Items (3)
A two-stage DEA model with partial impacts between inputs and outputs: application in refinery industries ⋮ An accelerated L-shaped method for solving two-stage stochastic programs in disaster management ⋮ Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
Uses Software
Cites Work
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
- Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- Analysis of stochastic problem decomposition algorithms in computational grids
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- New variants of bundle methods
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- The empirical behavior of sampling methods for stochastic programming
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Level bundle methods for oracles with on-demand accuracy
- Introduction to Stochastic Programming
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- A two-stage stochastic integer programming model for a thermal power system expansion
- Two-stage workforce planning under demand fluctuations and uncertainty
- Accelerating Benders method using covering cut bundle generation
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- Lectures on Stochastic Programming
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
- 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
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Building and solving large-scale stochastic programs on an affordable distributed computing system
This page was built for publication: Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
