Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
Author(s)Orlin, James B.
Sloan School of Management.
MetadataShow full item record
Cambridge, Mass. : Massachusetts Institute of Technology
Working paper (Sloan School of Management) ; 1615-84.
Network analysis., Algorithms.