A linear bound on the diameter of the transportation polytope
From MaRDI portal
Publication:858109
DOI10.1007/s00493-006-0010-5zbMath1150.90008OpenAlexW2111678432MaRDI QIDQ858109
Leen Stougie, Jan van den Heuvel, Graham R. Brightwell
Publication date: 8 January 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-006-0010-5
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items (16)
On the closest point to the origin in transportation polytopes ⋮ Obstructions to weak decomposability for simplicial polytopes ⋮ Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable ⋮ The hierarchy of circuit diameters and transportation polytopes ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ The Hirsch conjecture for the fractional stable set polytope ⋮ On sub-determinants and the diameter of polyhedra ⋮ On the Circuit Diameter of Some Combinatorial Polytopes ⋮ Polyhedral combinatorics of multi-index axial transportation problems ⋮ The diameters of network-flow polytopes satisfy the Hirsch conjecture ⋮ Random walks on the vertices of transportation polytopes with constant number of sources ⋮ On the shadow simplex method for curved polyhedra ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ The diameter of the stable marriage polytope: bounding from below ⋮ Graphs of transportation polytopes
This page was built for publication: A linear bound on the diameter of the transportation polytope
