Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/86701 |
| _version_ | 1826215039690866688 |
|---|---|
| author | Glenn, Andrew M., 1978- |
| author2 | Ismail Chabini. |
| author_facet | Ismail Chabini. Glenn, Andrew M., 1978- |
| author_sort | Glenn, Andrew M., 1978- |
| collection | MIT |
| description | Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001. |
| first_indexed | 2024-09-23T16:15:52Z |
| format | Thesis |
| id | mit-1721.1/86701 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T16:15:52Z |
| publishDate | 2014 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/867012019-04-12T16:03:01Z Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks Glenn, Andrew M., 1978- Ismail Chabini. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001. Includes bibliographical references (leaves 103-104). by Andrew M. Glenn. M.Eng.and S.B. 2014-05-07T16:59:11Z 2014-05-07T16:59:11Z 2001 2001 Thesis http://hdl.handle.net/1721.1/86701 49216030 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 104 leaves application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Glenn, Andrew M., 1978- Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks |
| title | Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks |
| title_full | Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks |
| title_fullStr | Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks |
| title_full_unstemmed | Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks |
| title_short | Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks |
| title_sort | algorithms for the shortest path problem with time windows and shortest path reoptimization in time dependent networks |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/86701 |
| work_keys_str_mv | AT glennandrewm1978 algorithmsfortheshortestpathproblemwithtimewindowsandshortestpathreoptimizationintimedependentnetworks |