Split Cuts in the Plane

DOI10.1137/20M1324521zbMath1458.90476arXiv2003.05022OpenAlexW3125294772MaRDI QIDQ5147031

Amitabh Basu, Hongyi Jiang, Marco Di Summa, Michele Conforti

Publication date: 2 February 2021

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

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

zbMATH Keywords

integer programmingcutting planessplit cuts

Mathematics Subject Classification ID

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

Related Items

Complexity of optimizing over the integers, Complexity of branch-and-bound and cutting planes in mixed-integer optimization

Cites Work

• Unnamed Item
• Chvátal closures for mixed integer programming problems
• A linear algorithm for integer programming in the plane
• Split closure and intersection cuts
• On finitely generated closures in the theory of cutting planes
• The triangle closure is a polyhedron
• On the Chvátal-Gomory closure of a compact convex set
• The split closure of a strictly convex body
• Integer Programming
• Computing Two-Dimensional Integer Hulls
• Cutting Planes and the Elementary Closure in Fixed Dimension