On algorithms for finding the k shortest paths in a network

Networks

Volumn 9, Issue 3, 1979, Pages 195-214

  Shier, D R ^a  

^a NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORKS, COMMUNICATION - OPTIMIZATION; MATHEMATICAL PROGRAMMING, LINEAR; OPERATIONS RESEARCH; TRANSPORTATION - ROUTE ANALYSIS;

MATHEMATICAL TECHNIQUES;

EID: 0018518940     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230090303     Document Type: Article

References (20)

1. Algorithm 360: Shortest Path Forest with Topological Ordering
2. A Note on Two Problems in Connexion with Graphs
3. An Appraisal of Some Shortest‐Path Algorithms
4. Calculating kth Shortest Paths
5. More on kth Shortest Paths
6. A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees
7. A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and its Application to Shortest Path Problems
8. On Computing Sets of Shortest Paths in a Graph
9. A Note on an Algebra for the k Best Routes in a Network
10. Implementation and Efficiency of Moore‐Algorithms for the Shortest Route Problem
11. Solutions of the kth Best Route Through a Network ‐ A Review
12. Computational Experience with an Algorithm for Finding the k Shortest Paths in a Network
13. Iterative Nethods for Determining the k Shortest Paths in a Network
14. Some Algorithms for Finding the Shortest Routes Through the General Networks
15. Finding the K Shortest Loopless Paths in a Network