Analysis of linear programming relaxations for a class of connectivity problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/13595 |
_version_ | 1826209106514411520 |
---|---|
author | Goemans, Michel X. (Michel Xavier) |
author2 | Dimitris Bertsimas. |
author_facet | Dimitris Bertsimas. Goemans, Michel X. (Michel Xavier) |
author_sort | Goemans, Michel X. (Michel Xavier) |
collection | MIT |
description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990. |
first_indexed | 2024-09-23T14:17:22Z |
format | Thesis |
id | mit-1721.1/13595 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T14:17:22Z |
publishDate | 2005 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/135952019-04-10T10:50:36Z Analysis of linear programming relaxations for a class of connectivity problems Goemans, Michel X. (Michel Xavier) Dimitris Bertsimas. Sloan School of Management Sloan School of Management Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990. Includes bibliographical references (leaves 142-149). by Michel X. Goemans. Ph.D. 2005-08-10T22:14:04Z 2005-08-10T22:14:04Z 1990 1990 Thesis http://hdl.handle.net/1721.1/13595 24147243 eng M.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 149 leaves 9643817 bytes 9643575 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
spellingShingle | Sloan School of Management Goemans, Michel X. (Michel Xavier) Analysis of linear programming relaxations for a class of connectivity problems |
title | Analysis of linear programming relaxations for a class of connectivity problems |
title_full | Analysis of linear programming relaxations for a class of connectivity problems |
title_fullStr | Analysis of linear programming relaxations for a class of connectivity problems |
title_full_unstemmed | Analysis of linear programming relaxations for a class of connectivity problems |
title_short | Analysis of linear programming relaxations for a class of connectivity problems |
title_sort | analysis of linear programming relaxations for a class of connectivity problems |
topic | Sloan School of Management |
url | http://hdl.handle.net/1721.1/13595 |
work_keys_str_mv | AT goemansmichelxmichelxavier analysisoflinearprogrammingrelaxationsforaclassofconnectivityproblems |