Show simple item record

Analysis of linear programming relaxations for a class of connectivity problems

dc.contributor.advisorDimitris Bertsimas.en_US
dc.contributor.authorGoemans, Michel X. (Michel Xavier)en_US
dc.date.accessioned2005-08-10T22:14:04Z
dc.date.available2005-08-10T22:14:04Z
dc.date.copyright1990en_US
dc.date.issued1990en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/13595
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.en_US
dc.descriptionIncludes bibliographical references (leaves 142-149).en_US
dc.description.statementofresponsibilityby Michel X. Goemans.en_US
dc.format.extent149 leavesen_US
dc.format.extent9643817 bytes
dc.format.extent9643575 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectSloan School of Managementen_US
dc.titleAnalysis of linear programming relaxations for a class of connectivity problemsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentSloan School of Managementen_US
dc.identifier.oclc24147243en_US


Files in this item

Thumbnail
Name:
24147243-MIT.pdf
Size:
9.196Mb
Format:
PDF
Description:
Full printable version
View/Open

This item appears in the following Collection(s)

Show simple item record