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.

A polynomial-time parametric simplex algorithm for the minimum cost network flow problem

Thumbnail Image
Download
Name

SWP-1484-15467654.pdf

Size

839.9 KB

Format

Adobe PDF

Checksum (MD5)

ad099dadaa39509138f9f6e7866343a4

Date Issued
1983
Publisher
Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 1484-83.
Description
"September 1983."
Bibliography: p. [15]
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.