A dual simplex algorithm for finding all shortest paths

M. Florian, Sang Nguyen, Stefano Pallottino. A dual simplex algorithm for finding all shortest paths. Networks, 11(4):367-378, 1981. [doi]

Abstract

Abstract is missing.