Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables

Cites Work

Partitioning procedures for solving mixed-variables programming problems
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
The ellipsoid method and its consequences in combinatorial optimization
New variants of bundle methods
Convex programming for disjunctive convex optimization
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Perspective cuts for a class of convex 0-1 mixed integer programs
Maximal Lattice-Free Convex Sets in Linear Subspaces
The Cutting-Plane Method for Solving Convex Programs
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
Inequalities from Two Rows of a Simplex Tableau
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Disjunctive programming: Properties of the convex hull of feasible points
An analysis of approximations for maximizing submodular set functions—I
Disjunctive Programming
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
The mixed vertex packing problem.
Mixing mixed-integer inequalities
The integer \(L\)-shaped method for stochastic integer programs with complete recourse
A global approach for general \(0-1\) fractional programming
Lift-and-project for mixed 0-1 programming: recent progress
Minimizing a stochastic maximum-reliability path
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Chvátal closures for mixed integer programming problems
On the facets of mixed integer programs with two integer variables and two constraints
Fenchel decomposition for stochastic mixed-integer programming
Cook, Kannan and Schrijver's example revisited
Title not available (Why is that?)
Experiments with Two Row Tableau Cuts
A branch-and-cut algorithm for the latent-class logit assortment problem
Lifting, tilting and fractional programming revisited
Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Title not available (Why is that?)
The Benders Dual Decomposition Method
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
Stochastic dual dynamic integer programming
Some lower bounds on sparse outer approximations of polytopes
Approximating polyhedra with sparse inequalities
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Local cuts for mixed-integer programming
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
Split cuts from sparse disjunctions
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts

This page was built for publication: Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589754)