Constructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniques
Name
36373970-MIT.pdf
Description
Full printable version
Size
12.12 MB
Format
Adobe PDF
Checksum (MD5)
91eadd78493abb30512c24a5714f22e0
Author(s)
Teo, Chungpiaw
Advisor(s)
Dimitris J. Bertsimas.
Date Issued
1996
Publisher
Massachusetts Institute of Technology
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.
Includes bibliographical references (p. 168-179).
Subjects
Sloan School of Management
MIT Department
Sloan School of Management
Massachusetts Institute of Technology. Operations Research Center
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.
Persistent DSpace Link
