Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints

DOI10.1287/ijoc.1100.0442zbMath1462.90074OpenAlexW2127350048WikidataQ57500088 ScholiaQ57500088MaRDI QIDQ2815438

Güzin Bayraksan, Brian Keller

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0eb70e6346ffc6d9052d765fc2fc2e2756b9f6f2

zbMATH Keywords

stochastic integer programmingstochastic schedulinggeneralized upper bound constraintsdisjunctive decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15)

Related Items

Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, An improved L-shaped method for solving process flexibility design problems, Decomposition algorithms for solving the minimum weight maximal matching problem

Cites Work

• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
• A comparative study of decomposition algorithms for stochastic combinatorial optimization
• Partitioning procedures for solving mixed-variables programming problems
• Optimization with disjunctive constraints
• Strengthening cuts for mixed integer programs
• Facial disjunctive programs and sequences of cutting-planes
• A converse for disjunctive constraints
• A cutting-plane approach to mixed 0-1 stochastic integer programs
• Stochastic integer programming: general models and algorithms
• Stochastic programming with integer variables
• 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 \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
• Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
• Continuity Properties of Expectation Functions in Stochastic Integer Programming
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• A Cutting-Plane Game for Facial Disjunctive Programs
• Disjunctive Programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming