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.

An auction/sequential shortest path algorithm for the minimum cost network flow problem

Thumbnail Image
Download
Name

P-2146-27644553.pdf

Size

1.31 MB

Format

Adobe PDF

Checksum (MD5)

1be02a121603e542d704efec6e57d38e

Date Issued
1992
Publisher
Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]
Series/Report no.
LIDS-P ; 2146
Description
Caption title.
Includes bibliographical references (p. 9-10).
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.