Two-halfspace closure

DOI10.1007/s10107-022-01802-xOpenAlexW4221036327MaRDI QIDQ2689824

Hongyi Jiang, Amitabh Basu

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

cutting planesinteger linear optimizationclosure complexityrank of closures

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the polyhedrality of cross and quadrilateral closures
• Chvátal closures for mixed integer programming problems
• On integer points in polyhedra
• Split closure and intersection cuts
• Aggregation-based cutting-planes for packing and covering integer programs
• On finitely generated closures in the theory of cutting planes
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• A geometric approach to cut-generating functions
• Some polyhedra related to combinatorial problems
• Convexity in cristallographical lattices
• Edmonds polytopes and a hierarchy of combinatorial problems
• Integer Programming
• Outline of an algorithm for integer solutions to linear programs
• Improved integer programming bounds using intersections of corner polyhedra
• An observation on the structure of production sets with indivisibilities
• A Theorem Concerning the Integer Lattice
• Computing Two-Dimensional Integer Hulls
• Disjunctive Programming
• On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
• On a Generalization of the Chvátal-Gomory Closure