Split cuts from sparse disjunctions
From MaRDI portal
Publication:2195684
DOI10.1007/s12532-020-00180-9zbMath1441.90099OpenAlexW2910526083MaRDI QIDQ2195684
Shenghao Yang, Ricardo Fukasawa, Laurent Poirrier
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
Related Items (1)
Uses Software
Cites Work
- 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
- On the separation of disjunctive cuts
- On the relative strength of split, triangle and quadrilateral cuts
- MIR closures of polyhedral sets
- Optimizing over the first Chvátal closure
- Approximating polyhedra with sparse inequalities
- Chvátal closures for mixed integer programming problems
- On the separation of split cuts and related inequalities
- A relax-and-cut framework for Gomory mixed-integer cuts
- A brief history of linear and mixed-integer programming computation
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On optimizing over lift-and-project closures
- MIPLIB 2003
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Zero-Coefficient Cuts
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- Sparsity of Lift-and-Project Cutting Planes
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
This page was built for publication: Split cuts from sparse disjunctions
