An update on the Hirsch conjecture
From MaRDI portal
Publication:613104
DOI10.1365/s13291-010-0001-8zbMath1252.05052arXiv0907.1186OpenAlexW3099025364MaRDI QIDQ613104
Edward D. Kim, Francisco Santos
Publication date: 17 December 2010
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.1186
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Distance in graphs (05C12)
Related Items
Quadratic diameter bounds for dual network flow polyhedra, More bounds on the diameters of convex polytopes, Obstructions to weak decomposability for simplicial polytopes, Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable, Cyclic polytopes, oriented matroids and intersections of quadrics, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, On the Combinatorial Diameters of Parallel and Series Connections, Polyhedral graph abstractions and an approach to the linear Hirsch conjecture, Edges versus circuits: a hierarchy of diameters in polyhedra, The hierarchy of circuit diameters and transportation polytopes, A counterexample to the Hirsch conjecture, On sub-determinants and the diameter of polyhedra, What Tropical Geometry Tells Us about the Complexity of Linear Programming, Constructing Clustering Transformations, Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count, On the circuit diameter conjecture, Unnamed Item, The diameters of network-flow polytopes satisfy the Hirsch conjecture, The width of five-dimensional prismatoids
