Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Technical Note—Shortest-Path Algorithms: A Comparison
Home
Publications
Technical Note—Shortest-Path Algorithms: A Comparison
Technical Note—Shortest-Path Algorithms: A Comparison
Author:
BG
Bruce Golden
Bruce Golden
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 December 1976
journal article
Published by
Institute for Operations Research and the Management Sciences (INFORMS)
in
Operations Research
Vol. 24
(6)
,
1164-1168
DOI:
10.1287/opre.24.6.1164
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.
Keywords
SHORTEST PATH ALGORITHM
Related articles
Cited
Cited by 107 articles
Scroll to top