Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Doctoral Theses
  5. Approximation algorithms for multicommodity flow and shop scheduling problems

Approximation algorithms for multicommodity flow and shop scheduling problems

Thumbnail Image
Download
Name

27781746-MIT.pdf

Description
Full printable version
Size

13.63 MB

Format

Adobe PDF

Checksum (MD5)

7923a47c5d31f867746974da7f3f1c6d

Author(s)
Stein, Clifford
Advisor(s)
David B. Shmoys.
Date Issued
1992
Publisher
Massachusetts Institute of Technology
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.
Includes bibliographical references (leaves 174-179).
Subjects
Electrical Engineering and Computer Science
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/12867
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.