The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
From MaRDI portal
Publication:4951046
DOI10.1287/moor.24.3.728zbMath0965.52009OpenAlexW2144476482MaRDI QIDQ4951046
Wojciech Banaszczyk, Alain Pajor, Alexander E. Litvak, Stanislaw J. Szarek
Publication date: 2 August 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.24.3.728
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10)
Related Items
Covering convex bodies by cylinders and lattice points by flats, Isosystolic inequalities for optical hypersurfaces, On integer programming with bounded determinants, The width and integer optimization on simplices with bounded minors of the constraint matrices, Lattice-free simplices with lattice width \(2d - o(d)\), New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors, On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases, A discrete version of Koldobsky's slicing inequality, A lower bound for the rank of a universal quadratic form with integer coefficients in a totally real number field, Analytic number theory. Abstracts from the workshop held November 6--12, 2022, On the complexity of quasiconvex integer minimization problem, Enumeration and unimodular equivalence of empty delta-modular simplices, Generalized flatness constants, spanning lattice polytopes, and the Gromov width, Complexity of optimizing over the integers, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, The Distributions of Functions Related to Parametric Integer Optimization, A randomized sieving algorithm for approximate integer programming, Approximation of Corner Polyhedra with Families of Intersection Cuts, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, Entanglement Thresholds for Random Induced States, A linear algorithm for integer programming in the plane, Short rational generating functions for lattice point problems, Integer convex minimization by mixed integer linear optimization, A local maximizer for lattice width of 3-dimensional hollow bodies, The complete classification of empty lattice 4-simplices, On the rational polytopes with Chvátal rank 1, Hollow polytopes of large width, The finiteness threshold width of lattice polytopes, The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point, Bounds on the lattice point enumerator via slices and projections
