Reverse split rank
From MaRDI portal
Publication:896287
DOI10.1007/s10107-015-0883-4zbMath1327.90117OpenAlexW2114626913WikidataQ57568101 ScholiaQ57568101MaRDI QIDQ896287
Marco Di Summa, Yuri Faenza, Alberto Del Pia, Michele Conforti
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0883-4
Related Items
Theoretical challenges towards cutting-plane selection, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of cutting-plane proofs
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
- On convergence in mixed integer programming
- Chvátal closures for mixed integer programming problems
- Covering minima and lattice-point-free convex bodies
- Disjunctive programming: Properties of the convex hull of feasible points
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- On the Convergence of the Affine Hull of the Chvátal--Gomory Closures
- Intersection Cuts with Infinite Split Rank
- On the Rank of Disjunctive Cuts
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Reverse Chvátal--Gomory Rank
- On Cutting Planes
- 0/1 Polytopes with Quadratic Chvátal Rank
- Convex Analysis
