{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/13595"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/13595","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Analysis of linear programming relaxations for a class of connectivity problems","abstract":"Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.","abstract_html":"Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.","abstract_has_math":false,"creators":["Goemans, Michel X. (Michel Xavier)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Sloan School of Management","school":null,"contributors":[],"advisors":["Dimitris Bertsimas."],"committee_chairs":[],"committee_members":[],"year":1990,"date_issued":"1990","date_published":"1990","updated_at":"2026-07-22T22:22:01Z","subjects":["Sloan School of Management"],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/13595","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Dimitris Bertsimas."]},{"key":"dc:contributor.department","label":"Department","values":["Sloan School of Management"]},{"key":"dc:creator","label":"Author","values":["Goemans, Michel X. (Michel Xavier)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-08-10T22:14:04Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-08-10T22:14:04Z"]},{"key":"dc:date.issued","label":"Date","values":["1990"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Sloan School of Management"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/13595"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.","Includes bibliographical references (leaves 142-149)."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Analysis of linear programming relaxations for a class of connectivity problems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Dimitris Bertsimas."],"dc:contributor.department":["Sloan School of Management"],"dc:creator":["Goemans, Michel X. (Michel Xavier)"],"dc:date.accessioned":["2005-08-10T22:14:04Z"],"dc:date.available":["2005-08-10T22:14:04Z"],"dc:date.issued":["1990"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.","Includes bibliographical references (leaves 142-149)."],"dc:description.degree":["Ph.D."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/13595"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Sloan School of Management"],"dc:title":["Analysis of linear programming relaxations for a class of connectivity problems"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:01Z"}