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)
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Flexible guidepath design for automated guided vehicle systems, A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem, An algorithm for ranking paths that may contain cycles, Construction of a real-world bilevel linear programming model of the highway network design problem, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, Network reduction for the acyclic constrained shortest path problem, On algorithms for finding the k shortest paths in a network, Shortest-path algorithms: Taxonomy and annotation, An efficient algorithm for K shortest simple paths, Unnamed Item, Iterative methods for determining the k shortest paths in a network