Decomposition algorithms for computational stochastic mixed-integer programming: a survey
From MaRDI portal
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A converging Benders' decomposition algorithm for two-stage mixed-integer recourse models
- A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse
- A hierarchy of bounds for stochastic mixed-integer programs
- A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
- A scalable bounding method for multistage stochastic programs
- A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
- A survey of contextual optimization methods for decision-making under uncertainty
- A survey on metaheuristics for stochastic combinatorial optimization
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- A unifying polyhedral approximation framework for convex optimization
- About the complexity of two-stage stochastic IPs
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Algorithms for stochastic mixed-integer programming models
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
- Approximate dynamic programming. Solving the curses of dimensionality
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Bounds and approximations for multistage stochastic programs
- Computational stochastic programming. Models, algorithms, and implementation
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
- Correction to: ``The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems
- Decision-dependent probabilities in stochastic programs with recourse
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Decomposition of test sets in stochastic integer programming
- Distances between optimal solutions of mixed-integer programs
- Distributionally robust optimization
- Dual decomposition in stochastic integer programming
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
- Ensemble variance reduction methods for stochastic mixed-integer programming and their application to the stochastic facility location problem
- Evaluation of scenario generation methods for stochastic programming
- Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
- Fenchel decomposition for stochastic mixed-integer programming
- Finite master programs in regularized stochastic decomposition
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- Finiteness theorems in stochastic integer programming
- scientific article; zbMATH DE number 1688599 (Why is no real title available?)
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 1953200 (Why is no real title available?)
- Hydro-electric unit commitment subject to uncertain demand
- Improving the integer L-shaped method
- Integer L-shaped and Lagrangian cuts revisited: a unified perspective
- Integration of progressive hedging and dual decomposition in stochastic integer programs
- Introduction to Stochastic Programming
- Lagrangian dual decision rules for multistage stochastic mixed-integer programming
- Lectures on stochastic programming. Modeling and theory
- Linear programming under uncertainty
- Measurable Selection and Dynamic Programming
- MIDAS: a mixed integer dynamic approximation scheme
- Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction
- Modeling time-dependent randomness in stochastic dual dynamic programming
- Multi-stage stochastic optimization applied to energy planning
- Multistage stochastic optimization
- Non-convex nested Benders decomposition
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- On parallelizing dual decomposition in stochastic integer programming
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees
- Partially adaptive multistage stochastic programming
- Pragmatic distributionally robust optimization for simple integer recourse models
- Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty
- Risk-adaptive approaches to stochastic optimization: a survey
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- Scenario reduction algorithms in stochastic programming
- Simple integer recourse models: convexity and convex approximations
- Solving stochastic programs with simple recourse
- Solving two-stage programs with endogenous uncertainty via random variable transformation
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic dual dynamic integer programming
- Stochastic dual dynamic programming and its variants: a review
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
- Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming
- Stochastic integer programming: general models and algorithms
- Stochastic Lipschitz dynamic programming
- Stochastic master surgery scheduling
- Stochastic programming with integer variables
- Stochastic programming with simple integer recourse
- Stochastic programming. Modeling decision problems under uncertainty
- Surgical case scheduling as a generalized job shop scheduling problem
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- The Benders dual decomposition method
- The double exponential runtime is tight for 2-stage stochastic ILPs
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The million-variable ``march for stochastic combinatorial optimization
- The policy graph decomposition of multistage stochastic programming problems
- The sample average approximation method for stochastic discrete optimization
- Tight lower bounds for block-structured integer programs
This page was built for publication: Decomposition algorithms for computational stochastic mixed-integer programming: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325494)
