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.

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems

Thumbnail Image
Download
Name

OR391-12.pdf

Size

304.48 KB

Format

Adobe PDF

Checksum (MD5)

5278397ee43114b67f8456e55b5bd125

Author(s)
Magnanti, Thomas L.
•
Stratila, Dan
Date Issued
February 15, 2012
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper Series;
;OR 391-12
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
An error occurred on the license name.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.