Split cuts from sparse disjunctions

DOI10.1007/S12532-020-00180-9MaRDI QIDQ2195684zbMATH OpenOpenAlexFDO

Authors Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang

Publication date 27 August 2020

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10012/14363

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Branching on split disjunctions
• Optimizing over the split closure
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
• How good are sparse cutting-planes?
• Cutting planes from wide split disjunctions

Cites work

• A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
• A brief history of linear and mixed-integer programming computation
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A relax-and-cut framework for Gomory mixed-integer cuts
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
• Approximating polyhedra with sparse inequalities
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• Chvátal closures for mixed integer programming problems
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• MIPLIB 2003
• MIR closures of polyhedral sets
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• On optimizing over lift-and-project closures
• On the relative strength of split, triangle and quadrilateral cuts
• On the separation of disjunctive cuts
• On the separation of split cuts and related inequalities
• Optimizing over the first Chvátal closure
• Optimizing over the split closure
• Permuting Sparse Rectangular Matrices into Block-Diagonal Form
• Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Sparsity of lift-and-project cutting planes
• Zero-coefficient cuts

Cited in

(10)

• Sparsity of lift-and-project cutting planes
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
• How good are sparse cutting-planes?
• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• scientific article; zbMATH DE number 1500572 (Why is no real title available?)
• Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
• Cutting planes from wide split disjunctions
• Branching on split disjunctions
• Split cuts for robust mixed-integer optimization
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables

Describes a project that uses

Uses Software

• MIPLIB
• MIPLIB2003
• GCG

This page was built for publication: Split cuts from sparse disjunctions

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