Show simple item record

The O-D shortest path problem and connectivity problems on periodic graphs

dc.contributor.advisorJames B. Orlin.en_US
dc.contributor.authorKodialam, Muralidharan S., 1963-en_US
dc.date.accessioned2005-08-15T16:04:30Z
dc.date.available2005-08-15T16:04:30Z
dc.date.copyright1991en_US
dc.date.issued1992en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/13087
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.en_US
dc.descriptionIncludes bibliographical references (leaves 118-119).en_US
dc.description.statementofresponsibilityby Muralidharan Kodialam.en_US
dc.format.extent119 leavesen_US
dc.format.extent7859595 bytes
dc.format.extent7859357 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.titleThe O-D shortest path problem and connectivity problems on periodic graphsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center
dc.identifier.oclc26342460en_US


Files in this item

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

This item appears in the following Collection(s)

Show simple item record