Reverse split rank

DOI10.1007/S10107-015-0883-4zbMATH Open1327.90117DBLPjournals/mp/ConfortiPSF15OpenAlexW2114626913WikidataQ57568101 ScholiaQ57568101MaRDI QIDQ896287FDOQ896287

Authors: Alberto Del Pia, Marco Di Summa, Yuri Faenza, 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

Recommendations

• Reverse split rank
• Reverse Chvátal-Gomory rank
• Reverse Chvátal-Gomory rank
• Cook, Kannan and Schrijver's example revisited
• Intersection cuts with infinite Split rank

zbMATH Keywords

integer programmingcutting planessplit rankinteger hullsplit inequalities

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Convex Analysis
• Title not available (Why is that?)
• Maximal lattice-free convex sets in linear subspaces
• Title not available (Why is that?)
• Disjunctive programming: Properties of the convex hull of feasible points
• On the complexity of cutting-plane proofs
• Covering minima and lattice-point-free convex bodies
• Intersection cuts with infinite Split rank
• Chvátal closures for mixed integer programming problems
• On Cutting Planes
• Title not available (Why is that?)
• On convergence in mixed integer programming
• Bounds on the Chvatal rank of polytopes in the 0/1-cube
• On the rank of disjunctive cuts
• Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
• On the convergence of the affine hull of the Chvàtal-Gomory closures
• Reverse Chvátal-Gomory rank
• 0/1 polytopes with quadratic Chvátal rank

Cited In (4)

• Theoretical challenges towards cutting-plane selection
• Reverse split rank
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
• Reverse Chvátal-Gomory rank

This page was built for publication: Reverse split rank

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