Lattice closures of polyhedra

DOI10.1007/s10107-019-01379-yzbMath1445.90063OpenAlexW2936395102WikidataQ128038723 ScholiaQ128038723MaRDI QIDQ2188243

Sanjeeb Dash, Diego A. Morán R., Oktay Günlük

Publication date: 10 June 2020

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

Full work available at URL: https://doi.org/10.1007/s10107-019-01379-y

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

On polytopes with linear rank with respect to generalizations of the split closure ⋮ Generalized Chvátal-Gomory closures for integer programs with bounds on variables ⋮ The aggregation closure is polyhedral for packing and covering integer programs

Cites Work

• Unnamed Item
• Unnamed Item
• On the polyhedrality of cross and quadrilateral closures
• On \(t\)-branch split cuts for mixed-integer programs
• On mixed-integer sets with two integer variables
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• On cutting-plane proofs in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• New bounds in some transference theorems in the geometry of numbers
• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
• On the relative strength of different generalizations of split cuts
• Split closure and intersection cuts
• Note on the complexity of the mixed-integer hull of a polyhedron
• \(\{ 0,\frac12\}\)-Chvátal-Gomory 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
• Integer Programming with a Fixed Number of Variables
• An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Integer Programming
• On Cutting Planes
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations
• Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
• Approximation of Corner Polyhedra with Families of Intersection Cuts
• On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
• The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Ordering by Divisibility in Abstract Algebras
• On the rank of mixed 0,1 polyhedra.