The O-D shortest path problem and connectivity problems on periodic graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/13087 |
| _version_ | 1826199144009564160 |
|---|---|
| author | Kodialam, Muralidharan S., 1963- |
| author2 | James B. Orlin. |
| author_facet | James B. Orlin. Kodialam, Muralidharan S., 1963- |
| author_sort | Kodialam, Muralidharan S., 1963- |
| collection | MIT |
| description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992. |
| first_indexed | 2024-09-23T11:15:05Z |
| format | Thesis |
| id | mit-1721.1/13087 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:15:05Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/130872019-04-11T08:42:41Z The O-D shortest path problem and connectivity problems on periodic graphs Kodialam, Muralidharan S., 1963- James B. Orlin. Sloan School of Management Sloan School of Management Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992. Includes bibliographical references (leaves 118-119). by Muralidharan Kodialam. Ph.D. 2005-08-15T16:04:30Z 2005-08-15T16:04:30Z 1991 1992 Thesis http://hdl.handle.net/1721.1/13087 26342460 eng 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 119 leaves 7859595 bytes 7859357 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Sloan School of Management Kodialam, Muralidharan S., 1963- The O-D shortest path problem and connectivity problems on periodic graphs |
| title | The O-D shortest path problem and connectivity problems on periodic graphs |
| title_full | The O-D shortest path problem and connectivity problems on periodic graphs |
| title_fullStr | The O-D shortest path problem and connectivity problems on periodic graphs |
| title_full_unstemmed | The O-D shortest path problem and connectivity problems on periodic graphs |
| title_short | The O-D shortest path problem and connectivity problems on periodic graphs |
| title_sort | o d shortest path problem and connectivity problems on periodic graphs |
| topic | Sloan School of Management |
| url | http://hdl.handle.net/1721.1/13087 |
| work_keys_str_mv | AT kodialammuralidharans1963 theodshortestpathproblemandconnectivityproblemsonperiodicgraphs AT kodialammuralidharans1963 odshortestpathproblemandconnectivityproblemsonperiodicgraphs |