| dc.creator |
Golden, Bruce L., 1950- |
|
| dc.date |
2004-05-28T19:30:40Z |
|
| dc.date |
2004-05-28T19:30:40Z |
|
| dc.date |
1975-10 |
|
| dc.date.accessioned |
2013-10-09T02:38:41Z |
|
| dc.date.available |
2013-10-09T02:38:41Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5263 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks. |
|
| dc.format |
1746 bytes |
|
| dc.format |
590953 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 044-75 |
|
| dc.title |
Shortest Path Algorithms: A Comparison |
|
| dc.type |
Working Paper |
|