Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem

Author(s)
Orlin, James B.
Thumbnail
Downloadgenuinelypolynom00orli.pdf (1.727Mb)
Other Contributors
Sloan School of Management.
Metadata
Show full item record
Description
"December 1984."
Date issued
1984]
URI
http://hdl.handle.net/1721.1/48015
Publisher
Cambridge, Mass. : Massachusetts Institute of Technology
Other identifiers
genuinelypolynom00orli
Series/Report no.
Working paper (Sloan School of Management) ; 1615-84.
Keywords
Network analysis., Algorithms.
Collections