Constructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniques

Author(s)
Teo, Chungpiaw
Thumbnail
DownloadFull printable version (12.11Mb)
Advisor
Dimitris J. 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, 1996.
 
Includes bibliographical references (p. 168-179).
 
Date issued
1996
URI
http://hdl.handle.net/1721.1/10671
Department
Sloan School of Management; Massachusetts Institute of Technology. Operations Research Center
Publisher
Massachusetts Institute of Technology
Keywords
Sloan School of Management
Collections