Lattice closures of polyhedra

DOI10.1007/S10107-019-01379-YMaRDI QIDQ2188243zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 4119933 (Why is no real title available?)
• An analysis of mixed integer linear sets based on lattice point free convex sets
• Approximation of corner polyhedra with families of intersection cuts
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Extension complexity lower bounds for mixed-integer extended formulations
• Geometric algorithms and combinatorial optimization
• Inequalities from Two Rows of a Simplex Tableau
• Integer Programming
• Integer Programming with a Fixed Number of Variables
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Lifting linear extension complexity bounds to the mixed-integer setting
• Maximal lattice-free convex sets in linear subspaces
• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
• New bounds in some transference theorems in the geometry of numbers
• Note on the complexity of the mixed-integer hull of a polyhedron
• On Cutting Planes
• On t-branch split cuts for mixed-integer programs
• On cutting-plane proofs in combinatorial optimization
• On finitely generated closures in the theory of cutting planes
• On mixed-integer sets with two integer variables
• On the Chvátal-Gomory closure of a compact convex set
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
• On the polyhedrality of cross and quadrilateral closures
• On the rank of mixed 0,1 polyhedra.
• On the relative strength of different generalizations of split cuts
• Ordering by Divisibility in Abstract Algebras
• Split closure and intersection cuts
• The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
• The triangle closure is a polyhedron
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts

Cited in

(11)

• The triangle closure is a polyhedron
• On the polyhedrality of cross and quadrilateral closures
• Closure constraints for hyperbolic tetrahedra
• On convergence in mixed integer programming
• Cook, Kannan and Schrijver's example revisited
• Closedness of integer hulls of simple conic sets
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• The aggregation closure is polyhedral for packing and covering integer programs
• On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
• 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)