| dc.contributor.advisor | John N. Tsitsiklis. | en_US |
| dc.contributor.author | Polychronopoulos, George H. (George Harry) | en_US |
| dc.date.accessioned | 2005-08-15T18:45:27Z | |
| dc.date.available | 2005-08-15T18:45:27Z | |
| dc.date.copyright | 1992 | en_US |
| dc.date.issued | 1992 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/12791 | |
| dc.description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992. | en_US |
| dc.description | Includes bibliographical references (p. 234-238). | en_US |
| dc.description.statementofresponsibility | by George H. Polychronopoulos. | en_US |
| dc.format.extent | viii, 238 p. | en_US |
| dc.format.extent | 23290648 bytes | |
| dc.format.extent | 23290405 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 | Electrical Engineering and Computer Science | en_US |
| dc.title | Stochastic and dynamic shortest distance problems | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | Ph.D. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
| dc.identifier.oclc | 27153417 | en_US |
