Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
By: by James B. Orlin.
Contributors: Sloan School of Management.
Series: Working paper / Alfred P. Sloan School of Management -- Sloan W.P. No. 1615-84; Working paper (Sloan School of Management) -- 1615-84.
Publisher: Massachusetts Institute of Technology
Published: 1984
Place of publication: Cambridge, Mass
Language: eng
Number of pages: 39
Subjects: Network analysis.; Algorithms.