A Theorem Concerning the Integer Lattice
From MaRDI portal
Cites work
Cited in
(35)- The topological structure of maximal lattice free convex bodies: The general case
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- A quantitative Doignon-Bell-Scarf theorem
- A subexponential bound for linear programming
- A proof of Lovász's theorem on maximal lattice-free sets
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Discrete quantitative Helly-type theorems with boxes
- Constructing lattice-free gradient polyhedra in dimension two
- Minimal infeasible constraint sets in convex integer programs
- A geometric approach to cut-generating functions
- Tight bounds on discrete quantitative Helly numbers
- On the facets of mixed integer programs with two integer variables and two constraints
- Quantitative Tverberg theorems over lattices and other discrete sets
- Duality in mathematics and linear and integer programming
- Two-halfspace closure
- Maximal S-free convex sets and the Helly number
- Helly’s theorem: New variations and applications
- Strengthening lattice-free cuts using non-negativity
- Feasibility in reverse convex mixed-integer programming
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Tverberg’s theorem is 50 years old: A survey
- A mélange of diameter Helly-type theorems
- Constructing lattice-free gradient polyhedra in dimension two
- The topological structure of maximal lattice free convex bodies: the general case
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Integer Farkas lemma
- On the complexity of cutting-plane proofs
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Complexity of optimizing over the integers
- On Helly numbers of exponential lattices
- Midpoints of vertex pairs of convex polytopes
- The prime grid contains arbitrarily large empty polygons
- Extensions of discrete Helly theorems for boxes
This page was built for publication: A Theorem Concerning the Integer Lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170530)
