Lattice closures of polyhedra

DOI10.1007/S10107-019-01379-YzbMATH Open1445.90063OpenAlexW2936395102WikidataQ128038723 ScholiaQ128038723MaRDI QIDQ2188243FDOQ2188243

Authors: Sanjeeb Dash, Diego Morán, 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

Recommendations

• On convergence in mixed integer programming
• The triangle closure is a polyhedron
• An analysis of mixed integer linear sets based on lattice point free convex sets
• On the polyhedrality of cross and quadrilateral closures
• On some generalizations of the split closure

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Closure constraints for hyperbolic tetrahedra
• Cook, Kannan and Schrijver's example revisited
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• The aggregation closure is polyhedral for packing and covering integer programs
• On polytopes with linear rank with respect to generalizations of the split closure
• An analysis of mixed integer linear sets based on lattice point free convex sets

This page was built for publication: Lattice closures of polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188243)