On polytopes with linear rank with respect to generalizations of the split closure

DOI10.1016/j.disopt.2023.100821arXiv2110.04344OpenAlexW4391001059WikidataQ129949900 ScholiaQ129949900MaRDI QIDQ6122082

Yatharth Dubey, Sanjeeb Dash

Publication date: 27 March 2024

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.04344

zbMATH Keywords

integer programmingcutting planessplit cuts

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Theory of computing (68Qxx) Proof theory and constructive mathematics (03Fxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(t\)-branch split cuts for mixed-integer programs
• On mixed-integer sets with two integer variables
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• On cutting-plane proofs in combinatorial optimization
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Lattice closures of polyhedra
• Two-halfspace closure
• On the Matrix-Cut Rank of Polyhedra
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Lower bounds for cutting planes proofs with small coefficients
• The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
• 0/1 Polytopes with Quadratic Chvátal Rank
• On the rank of mixed 0,1 polyhedra.
• On the power and limitations of branch and cut

This page was built for publication: On polytopes with linear rank with respect to generalizations of the split closure