Convex approximations for a class of mixed-integer recourse models
From MaRDI portal
Publication:1958624
DOI10.1007/s10479-009-0591-7zbMath1201.90143OpenAlexW2147911217MaRDI QIDQ1958624
Publication date: 4 October 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0591-7
Related Items
Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models ⋮ The stochastic programming heritage of Maarten van der Vlerk ⋮ Distributionally robust simple integer recourse ⋮ A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound ⋮ Simple integer recourse models: convexity and convex approximations ⋮ Monotonic bounds in multistage mixed-integer stochastic programming ⋮ Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty ⋮ Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Stochastic integer programming: general models and algorithms
- Stochastic programming with simple integer recourse
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Convex approximations for complete integer recourse models
- On the convex hull of the simple integer recourse objective function
- On structure and stability in stochastic programs with random technology matrix and complete integer recourse
- An algorithm for the construction of convex hulls in simple integer recourse programming
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Computational complexity of stochastic programming problems
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Solving a class of stochastic mixed-integer programs with branch and price
- Simple integer recourse models: convexity and convex approximations
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- On Optimal Allocation of Indivisibles Under Uncertainty
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Sequential Pairing of Mixed Integer Inequalities
- Introduction to Stochastic Programming
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
This page was built for publication: Convex approximations for a class of mixed-integer recourse models
