On algorithms for finding the k shortest paths in a network

DOI10.1002/net.3230090303zbMath0414.68034OpenAlexW1973804680MaRDI QIDQ3049826

Douglas R. Shier

Publication date: 1979

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230090303

zbMATH Keywords

algorithmsshortest paths in a network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items

The hierarchical network design problem, A fast method for discovering critical edge sequences in e-commerce catalogs, Object modeling and path computation for multimodal travel systems, Solving k-shortest and constrained shortest path problems efficiently, On finding dissimilar paths, New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems, An algorithm for finding the \(k\) quickest paths in a network, Multiple Routing Strategies in a Labelled Network, An algorithm for ranking paths that may contain cycles, Finding the k Shortest Paths, DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS, An algorithm for ranking paths in acyclic networks, Diversification strategies in local search for a nonbifurcated network loading problem, Unified approach to fuzzy graph problems

Cites Work

• Flows in transportation networks
• Computational experience with an algorithm for finding the k shortest paths in a network
• On Elmaghraby's “The Theory of Networks and Management Science”