Shortest Path Algorithms: A Comparison

Author(s)
Golden, Bruce L., 1950-
Thumbnail
DownloadOR-044-75.pdf (577.1Kb)
Metadata
Show full item record
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.
Date issued
1975-10
URI
http://hdl.handle.net/1721.1/5263
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 044-75
Collections