Analysis of linear programming relaxations for a class of connectivity problems

Author(s)
Goemans, Michel X. (Michel Xavier)
Thumbnail
DownloadFull printable version (9.196Mb)
Advisor
Dimitris Bertsimas.
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
Metadata
Show full item record
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.
 
Includes bibliographical references (leaves 142-149).
 
Date issued
1990
URI
http://hdl.handle.net/1721.1/13595
Department
Sloan School of Management
Publisher
Massachusetts Institute of Technology
Keywords
Sloan School of Management
Collections