Show simple item record

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

dc.contributor.advisorDimitris J. Bertsimas.en_US
dc.contributor.authorTeo, Chungpiawen_US
dc.date.accessioned2005-08-18T17:41:38Z
dc.date.available2005-08-18T17:41:38Z
dc.date.copyright1996en_US
dc.date.issued1996en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/10671
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.en_US
dc.descriptionIncludes bibliographical references (p. 168-179).en_US
dc.description.statementofresponsibilityby Chung-Piaw Teo.en_US
dc.format.extent179 p.en_US
dc.format.extent12707188 bytes
dc.format.extent12706946 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectSloan School of Managementen_US
dc.titleConstructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniquesen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center
dc.identifier.oclc36373970en_US


Files in this item

Thumbnail
Name:
36373970-MIT.pdf
Size:
12.11Mb
Format:
PDF
Description:
Full printable version
View/Open

This item appears in the following Collection(s)

Show simple item record