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

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.

Bibliographic Details
Main Author: Teo, Chungpiaw
Other Authors: Dimitris J. Bertsimas.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2005
Subjects:
Sloan School of Management
Online Access:http://hdl.handle.net/1721.1/10671

Internet

http://hdl.handle.net/1721.1/10671

Similar Items