Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Doctoral Theses
  5. Analysis of linear programming relaxations for a class of connectivity problems

Analysis of linear programming relaxations for a class of connectivity problems

Thumbnail Image
Download
Name

24147243-MIT.pdf

Description
Full printable version
Size

9.2 MB

Format

Adobe PDF

Checksum (MD5)

dabb58d1849b199395ccc322658a019d

Author(s)
Goemans, Michel X. (Michel Xavier)
Advisor(s)
Dimitris Bertsimas.
Date Issued
1990
Publisher
Massachusetts Institute of Technology
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.
Includes bibliographical references (leaves 142-149).
Subjects
Sloan School of Management
MIT Department
Sloan School of Management
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/13595
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.