The O-D shortest path problem and connectivity problems on periodic graphs
Citable URI:
http://hdl.handle.net/1721.1/13087
| Title: | The O-D shortest path problem and connectivity problems on periodic graphs |
| Author: | Kodialam, Muralidharan S., 1963- |
| Advisor: | James B. Orlin. |
| Department: | Sloan School of Management |
| Publisher: | Massachusetts Institute of Technology |
| Issue Date: | 1992 |
| Description: |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992. Includes bibliographical references (leaves 118-119). |
| URI: | http://hdl.handle.net/1721.1/13087 |
| Keywords: | Sloan School of Management |
Files in this item
| Files | Size | Format | View | Description |
|---|---|---|---|---|
| Preview, non-printable (open to all) | 7.859Mb |
View/ |
Preview, non-printable (open to all) | |
| Full printable version (MIT only) | 7.859Mb |
View/ |
Full printable version (MIT only) |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|