On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases
From MaRDI portal
Publication:5099099
DOI10.1137/21M145416XzbMath1496.52015arXiv2110.02893OpenAlexW3203458146MaRDI QIDQ5099099
Martin Henk, Stefan Kuhlmann, Robert Weismantel
Publication date: 31 August 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.02893
(n)-dimensional polytopes (52B11) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items
Enumeration and unimodular equivalence of empty delta-modular simplices, New Bounds for the Integer Carathéodory Rank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On integer programming with bounded determinants
- On the height of the minimal Hilbert basis
- Integer program with bimodular matrix
- The height of minimal Hilbert bases
- A note on non-degenerate integer programs with small sub-determinants
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Distances between optimal solutions of mixed-integer programs
- Submodular minimization under congruency constraints
- Integer Programming with a Fixed Number of Variables
- Generating abelian groups by addition only
- The Support of Integer Optimal Solutions
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Geometry of the Minimal Solutions of a Linear Diophantine Equation
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- A strongly polynomial algorithm for bimodular integer linear programming
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants
- Sparse Solutions of Linear Diophantine Equations
- On sub-determinants and the diameter of polyhedra
