The Hirsch Conjecture for Dual Transportation Polyhedra
该文给出一个算法，能在对偶运输多面体中用至多(m-1)(n-1)条极边连接任意一对极值点，对研究多面体直径的学者有参考价值。
An algorithm is given that joins any pair of extreme points of a dual transportation polyhedron by a path of at most (m − 1)(n − 1) extreme edges.