Iterative methods for determining the k shortest paths in a network

DOI10.1002/NET.3230060303zbMATH Open0364.90105OpenAlexW2089957823MaRDI QIDQ4140002FDOQ4140002

Authors: Douglas R. Shier 

Publication date: 1976

Published in: Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Cites Work

• Computational experience with an algorithm for finding the k shortest paths in a network
• Flows in transportation networks

Cited In (14)

• A framework for hierarchical interactive generation of cellular layout*
• Semirings and path spaces
• \(k\)-shortest routing of trains on shunting yards
• A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• On bounds for the convergence of the SSOR method forH-matrices
• The equity constrained shortest path problem
• The hierarchical network design problem
• An algorithm for the ranking of shortest paths
• Deviation algorithms for ranking shortest paths
• Robust supply chain design under uncertain demand in agile manufacturing
• CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
• Finding the k Shortest Paths
• Allowable processing orders in the accelerated cascade algorithm

This page was built for publication: Iterative methods for determining the k shortest paths in a network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140002)