Computational experience with an algorithm for finding the k shortest paths in a network
From MaRDI portal
Publication:4055399
DOI10.6028/jres.078B.020zbMath0301.90046MaRDI QIDQ4055399
Publication date: 1974
Published in: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (12)
Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Network reduction for the acyclic constrained shortest path problem ⋮ A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem ⋮ Shortest-path algorithms: Taxonomy and annotation ⋮ Flexible guidepath design for automated guided vehicle systems ⋮ Iterative methods for determining the k shortest paths in a network ⋮ On algorithms for finding the k shortest paths in a network ⋮ An efficient implementation of an algorithm for findingK shortest simple paths ⋮ An algorithm for ranking paths that may contain cycles ⋮ Construction of a real-world bilevel linear programming model of the highway network design problem ⋮ An efficient algorithm for K shortest simple paths ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
This page was built for publication: Computational experience with an algorithm for finding the k shortest paths in a network
