Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Doctoral Theses
  5. The O-D shortest path problem and connectivity problems on periodic graphs

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

Thumbnail Image
Download
Name

26342460-MIT.pdf

Description
Full printable version
Size

7.5 MB

Format

Adobe PDF

Checksum (MD5)

aeac3cbccb6288c113129ed0cc419407

Author(s)
Kodialam, Muralidharan S., 1963-
Advisor(s)
James B. Orlin.
Date Issued
1992
Publisher
Massachusetts Institute of Technology
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
Includes bibliographical references (leaves 118-119).
Subjects
Sloan School of Management
MIT Department
Sloan School of Management
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
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.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/13087
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.