Advanced Search
DSpace@MIT

A faster strongly polynomial minimum cost flow algorithm

Research and Teaching Output of the MIT Community

A faster strongly polynomial minimum cost flow algorithm

Download
Author: Orlin, James B., 1953-; Massachusetts Institute of Technology. Operations Research Center
Publisher: Massachusetts Institute of Technology, Operations Research Center
Date Issued: 1988
Description:
Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88Includes bibliographical references (leaf 11).
URI: http://hdl.handle.net/1721.1/5073
Other Identifiers: OR 175-88
Series/Report no.: Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 175-88. Working paper (Sloan School of Management) ; 2042-88.
Keywords: Q175.M41 O616 no.175-88

Show full item metadata

Files in this item

Name Size Format Description
OR-175-88-24515779.pdf 1.304Mb PDF

This item appears in the following Collection(s)

MIT-Mirage