On the diameter of lattice polytopes
From MaRDI portal
Publication:282757
DOI10.1007/s00454-016-9762-xzbMath1342.52014arXiv1512.07872OpenAlexW2220539176WikidataQ57568079 ScholiaQ57568079MaRDI QIDQ282757
Carla Michini, Alberto Del Pia
Publication date: 12 May 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07872
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Linear programming (90C05)
Related Items
Improving bounds on the diameter of a polyhedron in high dimensions ⋮ Distance between vertices of lattice polytopes ⋮ Primitive point packing ⋮ The diameter of lattice zonotopes ⋮ On the Combinatorial Diameters of Parallel and Series Connections ⋮ A note on the diameter of convex polytope ⋮ On Dantzig figures from graded lexicographic orders ⋮ Improved bounds on the diameter of lattice polytopes ⋮ The diameters of network-flow polytopes satisfy the Hirsch conjecture ⋮ Primitive zonotopes ⋮ Computational determination of the largest lattice polytope diameter ⋮ Elementary moves on lattice polytopes ⋮ An asymptotically improved upper bound on the diameter of polyhedra ⋮ A Generalized Simplex Method for Integer Problems Given by Verification Oracles ⋮ Short simplex paths in lattice polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for weighted fractional matroid matching
- Hamiltonicity in (0-1)-polyhedra
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- On the diameter of convex polytopes
- Stable matchings and linear inequalities
- The Hirsch conjecture is true for (0,1)-polytopes
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The Maximum-Weight Stable Matching Problem: Duality and Efficiency
- Integer Programming: Methods, Uses, Computations
- On sub-determinants and the diameter of polyhedra
- Geometry of cuts and metrics
