Reverse split rank

DOI10.1007/S10107-015-0883-4MaRDI QIDQ896287zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

integer programmingcutting planessplit rankinteger hullsplit inequalities

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Reverse split rank
• Cook, Kannan and Schrijver's example revisited
• Intersection cuts with infinite Split rank

Cites work

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

Cited in

(3)

• Theoretical challenges towards cutting-plane selection
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
• Reverse split 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)