scientific article; zbMATH DE number 3046578
From MaRDI portal
Publication:5785796
zbMATH Open0030.02002MaRDI QIDQ5785796FDOQ5785796
Publication date: 1948
Title of this publication is not available (Why is that?)
Cited In (25)
- Polynomial bounds in Koldobsky's discrete slicing problem
- Kronecker's approximation theorem
- On the number of lattice free polytopes
- Minkowski's successive minima in convex and discrete geometry
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- On estimates for integral solutions of linear inequalities
- A local maximizer for lattice width of 3-dimensional hollow bodies
- Lattice-free simplices with lattice width \(2d - o(d)\)
- On integer programming with bounded determinants
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
- Dual vectors and lower bounds for the nearest lattice point problem
- Inequalities for the lattice width of lattice-free convex sets in the plane
- Some remarks on inhomogeneous Diophantine approximations
- New bounds in some transference theorems in the geometry of numbers
- EXPECTED MEAN WIDTH OF THE RANDOMIZED INTEGER CONVEX HULL
- Lattice reduced and complete convex bodies
- A randomized sieving algorithm for approximate integer programming
- On the rational polytopes with Chvátal rank 1
- On rational approximations to an irrational number
- The probability that a convex body intersects the integer lattice in a \(k\)-dimensional set
- Title not available (Why is that?)
- On the complexity of quasiconvex integer minimization problem
- On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture
- Enumeration and unimodular equivalence of empty delta-modular simplices
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 Q5785796)
