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

DOI10.1007/978-3-031-06901-7_8zbMath1497.90129arXiv2111.07855OpenAlexW3214182848MaRDI QIDQ2164683

Rui Chen, James R. Luedtke

Publication date: 16 August 2022

Full work available at URL: https://arxiv.org/abs/2111.07855

zbMATH Keywords

valid inequalitiessparsityepigraphdisjunctive cuts

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for the latent-class logit assortment problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Lift-and-project for mixed 0-1 programming: recent progress
• Approximating polyhedra with sparse inequalities
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Disjunctive programming: Properties of the convex hull of feasible points
• Geometric algorithms and combinatorial optimization.
• Some lower bounds on sparse outer approximations of polytopes
• Fenchel decomposition for stochastic mixed-integer programming
• Split cuts from sparse disjunctions
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On the facets of mixed integer programs with two integer variables and two constraints
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer 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
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Minimizing a stochastic maximum-reliability path
• Experiments with Two Row Tableau Cuts
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Disjunctive Programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• The Benders Dual Decomposition Method
• A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
• Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
• Inequalities from Two Rows of a Simplex Tableau
• Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
• The mixed vertex packing problem.
• Mixing mixed-integer inequalities