Technical Note—Shortest-Path Algorithms: A Comparison

Bruce Golden
Additional contact information
Bruce Golden: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1976, vol. 24, issue 6, 1164-1168

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: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.6.1164 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:24:y:1976:i:6:p:1164-1168

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().