Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs

DOI10.1137/17M1149985zbMath1411.90222arXiv1710.00031OpenAlexW2964147683WikidataQ128688331 ScholiaQ128688331MaRDI QIDQ4646443

Marco Molinaro, Merve Bodur, Alberto Del Pia, Santanu S. Dey

Publication date: 14 January 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

coveringinteger programmingpackingsplit ranklattice-free rankmulti-branch split rank

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• On \(t\)-branch split cuts for mixed-integer programs
• Cutting planes from extended LP formulations
• Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
• A note on the split rank of intersection cuts
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Reverse split rank
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Aggregation-based cutting-planes for packing and covering integer programs
• On finitely generated closures in the theory of cutting planes
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• A geometric approach to cut-generating functions
• Approximation of corner polyhedra with families of intersection cuts
• Optimizing over the split closure
• Split Rank of Triangle and Quadrilateral Inequalities
• Intersection Cuts with Infinite Split Rank
• Minimal Valid Inequalities for Integer Constraints
• Integer Programming
• The Group-Theoretic Approach in Mixed Integer Programming
• On Cutting Planes
• Disjunctive Programming
• Inequalities from Two Rows of a Simplex Tableau
• Convex Analysis