Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor James B. Orlin. en_US
dc.contributor.author Kodialam, Muralidharan S., 1963- en_US
dc.date.accessioned 2005-08-15T16:04:30Z
dc.date.available 2005-08-15T16:04:30Z
dc.date.copyright 1991 en_US
dc.date.issued 1992 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/13087
dc.description Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992. en_US
dc.description Includes bibliographical references (leaves 118-119). en_US
dc.description.statementofresponsibility by Muralidharan Kodialam. en_US
dc.format.extent 119 leaves en_US
dc.format.extent 7859595 bytes
dc.format.extent 7859357 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 Sloan School of Management en_US
dc.title The O-D shortest path problem and connectivity problems on periodic graphs en_US
dc.type Thesis en_US
dc.description.degree Ph.D. en_US
dc.contributor.department Sloan School of Management en_US
dc.identifier.oclc 26342460 en_US


Files in this item

Name Size Format Description
26342460.pdf 7.495Mb PDF Preview, non-printable (open to all)
26342460-MIT.pdf 7.495Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage