We are experiencing minor difficulties with some of our submission forms, which we are working to resolve. You should still be able to submit items, but if you have any issues while submitting, please contact us at dspace-lib@mit.edu.

Shortest Path Algorithms: A Comparison

Thumbnail Image
Download
Name

OR-044-75.pdf

Size

577.1 KB

Format

Adobe PDF

Checksum (MD5)

3136057964bd6e62c16c78f19aa30052

Author(s)
Golden, Bruce L., 1950-
Date Issued
October 1975
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 044-75
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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.