Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems

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.
An error occurred getting the license - uri.
Persistent DSpace Link
http://hdl.handle.net/1721.1/69107
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.