| dc.contributor.author | Golden, Bruce L., 1950- | en_US |
| dc.date.accessioned | 2004-05-28T19:30:40Z | |
| dc.date.available | 2004-05-28T19:30:40Z | |
| dc.date.issued | 1975-10 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5263 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 1746 bytes | |
| dc.format.extent | 590953 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 044-75 | en_US |
| dc.title | Shortest Path Algorithms: A Comparison | en_US |
| dc.type | Working Paper | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
