A Linear Bound On The Diameter Of The Transportation Polytope*

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).

Authors and Affiliations

1. Centre for Discrete and Applicable Mathematics and Department of Mathematics, London School of Economics, London, U.K.

   Graham Brightwell & Jan van den Heuvel

2. Technische Universiteit Eindhoven and CWI Amsterdam, Amsterdam, The Netherlands

   Leen Stougie†

Corresponding author

Correspondence to Graham Brightwell.

* Research for this paper was done while the second and third author were visiting the Isaac Newton Institute for Mathematical Sciences, Cambridge, U.K. All authors were supported by the TMR Network DONET of the European Community ERB TMRXCT98-0202.

† Research partially funded by the Dutch BSIK/BRICKS project.

Reprints and permissions