Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
From MaRDI portal
Publication:2502202
DOI10.1007/s10107-006-0711-yzbMath1130.90378OpenAlexW2086284542MaRDI QIDQ2502202
Nan Kong, Andrew J. Schaefer, Brady Hunsaker
Publication date: 12 September 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0711-y
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)
Related Items (21)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ Evaluating mixed-integer programming models over multiple right-hand sides ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ Totally unimodular stochastic programs ⋮ Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Convex approximations for a class of mixed-integer recourse models ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Exact solution approach for a class of nonlinear bilevel knapsack problems ⋮ The bilevel knapsack problem with stochastic right-hand sides ⋮ A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management ⋮ A Gilmore-Gomory construction of integer programming value functions ⋮ A note on constraint aggregation and value functions for two-stage stochastic integer programs ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization
Cites Work
- 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
- 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 primal dual integer programming algorithm
- Stochastic programming with simple integer recourse
- 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
- 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 expected value function of a simple integer recourse problem with random technology matrix
- 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
- Some polyhedra related to combinatorial problems
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Short rational functions for toric algebra and applications
- On Optimal Allocation of Indivisibles Under Uncertainty
- Subadditive lifting methods for partitioning and knapsack problems
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- Characterization of facets for multiple right-hand choice linear programs
- Integer programming duality: Price functions and sensitivity analysis
- The value function of an integer program
- On the foundations of linear and integer linear programming I
- The stochastic single resource service-provision problem
- Toric ideals of homogeneous phylogenetic models
- A stochastic integer programming approach to solving a synchronous optical network ring design problem
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- A Geometric Buchberger Algorithm for Integer Programming
- The Theory and Computation of Knapsack Functions
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
