Analysis of linear programming relaxations for a class of connectivity problems

Analysis of linear programming relaxations for a class of connectivity problems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990. === Includes bibliographical references (leaves 142-149). === by Michel X. Goemans. === Ph.D.

Bibliographic Details
Main Author: Goemans, Michel X. (Michel Xavier)
Other Authors: Dimitris Bertsimas.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2005
Subjects:
Sloan School of Management
Online Access:http://hdl.handle.net/1721.1/13595

Similar Items

Similar Items