Show simple item record

dc.contributor.advisorAmedeo Odoni and Daniel Kleitman.en_US
dc.contributor.authorBertsimas, Dimitrisen_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2005-08-09T17:00:50Z
dc.date.available2005-08-09T17:00:50Z
dc.date.copyright1988en_US
dc.date.issued1988en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/14386
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.statementofresponsibilityby Dimitris J. Bertsimas.en_US
dc.format.extent[1], 171 leavesen_US
dc.format.extent11381943 bytes
dc.format.extent11381698 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.subjectMathematics.en_US
dc.titleProbabilistic combinatorial optimization problemsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center
dc.identifier.oclc20107358en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record