Return to search

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

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996. / Includes bibliographical references (p. 168-179). / by Chung-Piaw Teo. / Ph.D.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/10671
Date January 1996
CreatorsTeo, Chungpiaw
ContributorsDimitris J. Bertsimas., Sloan School of Management
PublisherMassachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format179 p., 12707188 bytes, 12706946 bytes, application/pdf, application/pdf, application/pdf
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., http://dspace.mit.edu/handle/1721.1/7582

Page generated in 0.0022 seconds