We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

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

Thumbnail Image
Download
Name

genuinelypolynom00orli.pdf

Size

1.73 MB

Format

Adobe PDF

Checksum (MD5)

c4650c293791833939d8f1d35acc69df

Author(s)
Orlin, James B.
Date Issued
1984]
Publisher
Cambridge, Mass. : Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 1615-84.
Description
"December 1984."
Subjects
Network analysis.
Algorithms.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.