An O(n) bound for the diameter of transshipment polytopes

Authors:
Fred J Rispoli
Affiliations:
Department of Mathematics, Dowling College, Oakdale, NY 11769, USA
Venue:
Operations Research Letters
Year:
1992

Citing 3
Cited 0

The d-step conjecture and its relatives

Mathematics of Operations Research
A shortest augmenting path algorithm for the semi-assignment problem

Operations Research
The monotonic diameter of the perfect matching and shortest path polytopes

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The diameter of any transshipment polytope associated to the complete directed graph on n nodes is shown to be less than 2(n - 1). This bound is twice the bound given by the Hirsch conjecture and improves the best known bound which is O(n^3).