More bounds on the diameters of convex polytopes
From MaRDI portal
Publication:5299904
DOI10.1080/10556788.2012.668906zbMath1266.52016arXiv0911.4982OpenAlexW2086847284MaRDI QIDQ5299904
David Bremner, William Hua, Antoine Deza, Lars Schewe
Publication date: 24 June 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4982
Related Items
Enumerating Neighborly Polytopes and Oriented Matroids, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, Topological Prismatoids and Small Simplicial Spheres of Large Diameter, Realizability and inscribability for simplicial polytopes via nonlinear optimization, A counterexample to the Hirsch conjecture, A proof of the strict monotone 5-step conjecture, On Dantzig figures from graded lexicographic orders, On the circuit diameter conjecture, A formalization of convex polyhedra based on the simplex method, On the Holt-Klee property for oriented matroid programming, An asymptotically improved upper bound on the diameter of polyhedra
Cites Work
- Unnamed Item
- An update on the Hirsch conjecture
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
- Graphs of transportation polytopes
- Symmetric matroid polytopes and their generation
- Many polytopes meeting the conjectured Hirsch bound
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- Some upper bounds for the diameters of convex polytopes
- The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- Diameter of Polyhedra: Limits of Abstraction
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Oriented Matroids
- Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- Diameters of Polyhedral Graphs
