Pages that link to "Item:Q507318"
From MaRDI portal
The following pages link to The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318):
Displaying 25 items.
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- A hierarchy of bounds for stochastic mixed-integer programs (Q1949254) (← links)
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- Optimal crashing of an activity network with disruptions (Q2149579) (← links)
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk (Q2189450) (← links)
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models (Q2235163) (← links)
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs (Q2901080) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse (Q3100464) (← links)
- Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs (Q5106425) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- Correction to: ``The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming'' (Q6126668) (← links)
- Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)
