A linear bound on the diameter of the transportation polytope

G. Brightwell, J. Heuvel, van den, L. Stougie

Research output: Contribution to journalArticleAcademicpeer-review

22 Citations (Scopus)

Abstract

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).
Original languageEnglish
Pages (from-to)133-139
JournalCombinatorica
Volume26
Issue number2
DOIs
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'A linear bound on the diameter of the transportation polytope'. Together they form a unique fingerprint.

Cite this