Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights
From MaRDI portal
Publication:3565463
DOI10.1007/978-0-387-75714-8_12zbMath1220.90074MaRDI QIDQ3565463
Publication date: 4 June 2010
Published in: Advances in Mechanics and Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-75714-8_12
disjunctive programming; convexification; branch-and-cut; Benders' decomposition; reformulation-linearization technique (RLT); L-shaped method; two-stage stochastic mixed-integer programs
Related Items
Vehicle routing with probabilistic capacity constraints, An efficient computational method for large scale surgery scheduling problems with chance constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Partitioning procedures for solving mixed-variables programming problems
- Optimization with disjunctive constraints
- A converse for disjunctive constraints
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Stochastic integer programming: general models and algorithms
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A modified lift-and-project procedure
- Stochastic programming with integer variables
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Decomposition of test sets in stochastic integer programming
- Dynamic capacity acquisition and assignment under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- 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
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The million-variable ``march for stochastic combinatorial optimization
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- 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
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Cutting-Plane Game for Facial Disjunctive Programs
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- The value function of an integer program
- On the foundations of linear and integer linear programming I
- Disjunctive Programming
- Two‐stage stochastic integer programming: a survey
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
