A Linear Bound On The Diameter Of The Transportation Polytope*

Authors:
Graham Brightwell;Jan van den Heuvel;Leen Stougie†
Affiliations:
Centre for Discrete and Applicable Mathematics and Department of Mathematics, London School of Economics, London, U.K.;Centre for Discrete and Applicable Mathematics and Department of Mathematics, London School of Economics, London, U.K.;Technische Universiteit Eindhoven and CWI Amsterdam, Amsterdam, The Netherlands
Venue:
Combinatorica
Year:
2006

Graphs of transportation polytopes

Journal of Combinatorial Theory Series A
On sub-determinants and the diameter of polyhedra

Proceedings of the twenty-eighth annual symposium on Computational geometry
Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable

Mathematics of Operations Research
Finding short paths on polytopes by the shadow vertex algorithm

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Hi-index	0.00

We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m×n transportation problem is at most 8(m+n−2).