Computational study of an improved shortest path algorithm

This publication has 10 references indexed in Scilit:

• A new algorithm to find the shortest paths between all pairs of nodes
  Discrete Applied Mathematics, 1982
• A dual simplex algorithm for finding all shortest paths
  Networks, 1981
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
  Networks, 1979
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
  Operations Research, 1979
• Technical Note—Shortest-Path Algorithms: A Comparison
  Operations Research, 1976
• Implementation and efficiency of Moore-algorithms for the shortest route problem
  Mathematical Programming, 1974
• A performance comparison of labeling algorithms for calculating shortest path trees
  Published by National Institute of Standards and Technology (NIST) ,1973
• On shortest paths and sorting
  Published by Association for Computing Machinery (ACM) ,1972
• An Appraisal of Some Shortest-Path Algorithms
  Operations Research, 1969
• Linear Programming and Extensions
  Published by Walter de Gruyter GmbH ,1963