A Theorem Concerning the Integer Lattice

DOI10.1002/sapm1977562187zbMath0388.90051OpenAlexW107540463MaRDI QIDQ4170530

David E. Bell

Publication date: 1977

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm1977562187

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Tight bounds on discrete quantitative Helly numbers, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, On the facets of mixed integer programs with two integer variables and two constraints, The topological structure of maximal lattice free convex bodies: The general case, Quantitative Tverberg theorems over lattices and other discrete sets, A subexponential bound for linear programming, Complexity of optimizing over the integers, A proof of Lovász's theorem on maximal lattice-free sets, On Helly numbers of exponential lattices, Two-halfspace closure, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Strengthening lattice-free cuts using non-negativity, Feasibility in reverse convex mixed-integer programming, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Helly’s theorem: New variations and applications, Relaxations of mixed integer sets from lattice-free polyhedra, A quantitative Doignon-Bell-Scarf theorem, Relaxations of mixed integer sets from lattice-free polyhedra, Quantitative \((p, q)\) theorems in combinatorial geometry, Minimal infeasible constraint sets in convex integer programs, On the complexity of cutting-plane proofs, Tverberg’s theorem is 50 years old: A survey, Discrete quantitative Helly-type theorems with boxes, Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization, Maximal $S$-Free Convex Sets and the Helly Number, 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, Duality in mathematics and linear and integer programming, Integer Farkas Lemma, A Mélange of Diameter Helly-Type Theorems, A geometric approach to cut-generating functions, Constructing lattice-free gradient polyhedra in dimension two

Cites Work

• Lattice points on convex curves
• Improved integer programming bounds using intersections of corner polyhedra
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points