Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs

DOI10.1287/opre.1100.0882zbMath1218.90132OpenAlexW2072121858MaRDI QIDQ3013929

Simge Küçükyavuz, Suvrajeet Sen, Binyuan Chen

Publication date: 19 July 2011

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1100.0882

zbMATH Keywords

convex hulldisjunctive programmingmixed-integer programmingfinite convergence

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Theoretical challenges towards cutting-plane selection, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs, Cut generation through binarization, Correction to: ``The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs

Uses Software

• Bonmin