scientific article; zbMATH DE number 4119933
From MaRDI portal
Publication:4733665
Recommendations
Cited in
(62)- The topological structure of maximal lattice free convex bodies: The general case
- Intersection cuts for single row corner relaxations
- Theoretical challenges towards cutting-plane selection
- On finitely generated closures in the theory of cutting planes
- Generalized intersection cuts and a new cut generating paradigm
- A local maximizer for lattice width of 3-dimensional hollow bodies
- The covering radius and a discrete surface area for non-hollow simplices
- Difference between families of weakly and strongly maximal integral lattice-free polytopes
- Constructing lattice-free gradient polyhedra in dimension two
- Complexity of linear relaxations in integer programming
- Lattice closures of polyhedra
- The triangle closure is a polyhedron
- Design and verify: a new scheme for generating cutting-planes
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- A geometric approach to cut-generating functions
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
- Tight bounds on discrete quantitative Helly numbers
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- An algorithm for the separation of two-row cuts
- Certificates of linear mixed integer infeasibility
- Two row mixed-integer cuts via lifting
- Mixed-integer sets from two rows of two adjacent simplex bases
- Maximal S-free convex sets and the Helly number
- Helly’s theorem: New variations and applications
- scientific article; zbMATH DE number 4132269 (Why is no real title available?)
- scientific article; zbMATH DE number 5131011 (Why is no real title available?)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- Closedness of integer hulls of simple conic sets
- Computing with Multi-row Gomory Cuts
- Integer programming and algorithmic geometry of numbers
- scientific article; zbMATH DE number 3987367 (Why is no real title available?)
- Minkowski's Convex Body Theorem and Integer Programming
- Some properties of convex hulls of integer points contained in general convex sets
- Unique lifting of integer variables in minimal inequalities
- The Empty Sphere
- scientific article; zbMATH DE number 4051349 (Why is no real title available?)
- scientific article; zbMATH DE number 58037 (Why is no real title available?)
- Strengthening lattice-free cuts using non-negativity
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- Approximation of corner polyhedra with families of intersection cuts
- Enumerating projections of integer points in unbounded polyhedra
- scientific article; zbMATH DE number 939815 (Why is no real title available?)
- scientific article; zbMATH DE number 922411 (Why is no real title available?)
- scientific article; zbMATH DE number 922563 (Why is no real title available?)
- On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
- Mixed-integer convex representability
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- On a problem in the geometry of numbers
- Poisson approximation and Weibull asymptotics in the geometry of numbers
- Relaxations of mixed integer sets from lattice-free polyhedra
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Towards a characterization of maximal quadratic-free sets
- On the relative strength of split, triangle and quadrilateral cuts
- Lattice reduced and complete convex bodies
- A characterization of maximal homogeneous-quadratic-free sets
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Lifting properties of maximal lattice-free polyhedra
- Reverse split rank
- Computing with multi-row gomory cuts
- Equivalence between intersection cuts and the corner polyhedron
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733665)
