Pages that link to "Item:Q2355924"
From MaRDI portal
The following pages link to Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method (Q2355924):
Displaying 17 items.
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study (Q297279) (← links)
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse (Q976324) (← links)
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
- An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
- A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
- Improving the integer L-shaped method (Q2830952) (← links)
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs (Q4586174) (← links)
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
- Efficient Stochastic Programming in Julia (Q5106388) (← links)
- Accelerating techniques on nested decomposition (Q5268932) (← links)
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5501230) (← links)
- An asynchronous parallel benders decomposition method for stochastic network design problems (Q6551056) (← links)
