Analysis of linear programming relaxations for a class of connectivity problems
Citable URI:
http://hdl.handle.net/1721.1/13595
| Title: | Analysis of linear programming relaxations for a class of connectivity problems |
| Author: | Goemans, Michel X. (Michel Xavier) |
| Advisor: | Dimitris Bertsimas. |
| Department: | Sloan School of Management |
| Publisher: | Massachusetts Institute of Technology |
| Issue Date: | 1990 |
| Description: |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990. Includes bibliographical references (leaves 142-149). |
| URI: | http://hdl.handle.net/1721.1/13595 |
| Keywords: | Sloan School of Management |
Files in this item
| Files | Size | Format | View | Description |
|---|---|---|---|---|
| Preview, non-printable (open to all) | 9.643Mb |
View/ |
Preview, non-printable (open to all) | |
| Full printable version (MIT only) | 9.643Mb |
View/ |
Full printable version (MIT only) |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|