On the convex hull of the simple integer recourse objective function
From MaRDI portal
Publication:1896454
DOI10.1007/BF02031708zbMath0835.90056OpenAlexW2268901806MaRDI QIDQ1896454
Maarten H. van der Vlerk, Willem K. Klein Haneveld, Leen Stougie
Publication date: 27 August 1995
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02031708
Related Items (19)
Multiperiod capacity expansion of a telecommunications connection with uncertain demand ⋮ K-Adaptability in Two-Stage Robust Binary Programming ⋮ On structure and stability in stochastic programs with random technology matrix and complete integer recourse ⋮ Challenges in stochastic programming ⋮ SLP-IOR: An interactive model management system for stochastic linear programs ⋮ A model for strategic planning under uncertainty ⋮ An algorithm for the construction of convex hulls in simple integer recourse programming ⋮ On multiple simple recourse models ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Convex approximations for a class of mixed-integer recourse models ⋮ Convex approximations for complete integer recourse models ⋮ The stochastic programming heritage of Maarten van der Vlerk ⋮ Distributionally robust simple integer recourse ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ Simple integer recourse models: convexity and convex approximations ⋮ Underground mine scheduling under uncertainty ⋮ A cutting-plane approach to mixed 0-1 stochastic integer programs ⋮ The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
Cites Work
This page was built for publication: On the convex hull of the simple integer recourse objective function
