2026-09-25T08:06:35Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/135952021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Dimitris Bertsimas.
Goemans, Michel X. (Michel Xavier)
Sloan School of Management
2005-08-10T22:14:04Z
2005-08-10T22:14:04Z
1990
1990
http://hdl.handle.net/1721.1/13595
24147243
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.
Includes bibliographical references (leaves 142-149).
by Michel X. Goemans.
Ph.D.
149 leaves
9643817 bytes
9643575 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Sloan School of Management
Analysis of linear programming relaxations for a class of connectivity problems
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b2de1d69-5e71-4754-81a8-bbcf762f06be">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Analysis of linear programming relaxations for a class of connectivity problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1990</PublicationDate>
<Authors>
<Author>
<DisplayName>Goemans, Michel X. (Michel Xavier)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Sloan School of Management</Keyword>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>