dc.contributor.advisor | Amedeo Odoni and Daniel Kleitman. | en_US |
dc.contributor.author | Bertsimas, Dimitris | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Dept. of Mathematics. | en_US |
dc.date.accessioned | 2005-08-09T17:00:50Z | |
dc.date.available | 2005-08-09T17:00:50Z | |
dc.date.copyright | 1988 | en_US |
dc.date.issued | 1988 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/14386 | |
dc.description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988. | en_US |
dc.description | Includes bibliographical references. | en_US |
dc.description.statementofresponsibility | by Dimitris J. Bertsimas. | en_US |
dc.format.extent | [1], 171 leaves | en_US |
dc.format.extent | 11381943 bytes | |
dc.format.extent | 11381698 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
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. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
dc.subject | Mathematics. | en_US |
dc.title | Probabilistic combinatorial optimization problems | en_US |
dc.type | Thesis | en_US |
dc.description.degree | Ph.D. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
dc.identifier.oclc | 20107358 | en_US |