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.

E-relaxation and auction method for separable convex cost network flow problems

Thumbnail Image
Download
Name

P-2367-36046945.pdf

Size

1.89 MB

Format

Adobe PDF

Checksum (MD5)

399b02bf05001e249d4864e8bb783f19

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