Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
From MaRDI portal
Publication:2502202
Recommendations
- Two-stage quadratic integer programs with stochastic right-hand sides
- Stochastic dual dynamic integer programming
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- scientific article; zbMATH DE number 1688599
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- A Geometric Buchberger Algorithm for Integer Programming
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- A primal dual integer programming algorithm
- A stochastic integer programming approach to solving a synchronous optical network ring design problem
- An algorithm for the construction of convex hulls in simple integer recourse programming
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Characterization of facets for multiple right-hand choice linear programs
- Decomposition of test sets in stochastic integer programming
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Dual decomposition in stochastic integer programming
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4053339 (Why is no real title available?)
- scientific article; zbMATH DE number 3664742 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3578640 (Why is no real title available?)
- scientific article; zbMATH DE number 2086935 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3431974 (Why is no real title available?)
- Integer programming duality: Price functions and sensitivity analysis
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- On optimal allocation of indivisibles under uncertainty
- On structure and stability in stochastic programs with random technology matrix and complete integer recourse
- On the convex hull of the simple integer recourse objective function
- On the expected value function of a simple integer recourse problem with random technology matrix
- On the foundations of linear and integer linear programming I
- Short rational functions for toric algebra and applications
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Some polyhedra related to combinatorial problems
- Stochastic integer programming: general models and algorithms
- Stochastic programming with integer variables
- Stochastic programming with simple integer recourse
- Subadditive lifting methods for partitioning and knapsack problems
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The stochastic single resource service-provision problem
- The Theory and Computation of Knapsack Functions
- The value function of an integer program
- Toric ideals of homogeneous phylogenetic models
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
Cited in
(24)- Totally unimodular stochastic programs
- Convex approximations for a class of mixed-integer recourse models
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- A Gilmore-Gomory construction of integer programming value functions
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Integer set reduction for stochastic mixed-integer programming
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- Two-stage stochastic mixed-integer programs: algorithms and insights
- Two-stage quadratic integer programs with stochastic right-hand sides
- Tight second stage formulations in two-stage stochastic mixed integer programs
- A unified framework for multistage mixed integer linear optimization
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- The gap function: evaluating integer programming models over multiple right-hand sides
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Evaluating mixed-integer programming models over multiple right-hand sides
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- The bilevel knapsack problem with stochastic right-hand sides
This page was built for publication: Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502202)