A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem

DOI10.1016/S0893-9659(00)00099-9zbMath0965.90054OpenAlexW2006998711MaRDI QIDQ5931724

Ervin Y. Rodin, K. A. Rink, Sundarapandian Vaidyanathan

Publication date: 25 April 2001

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(00)00099-9

zbMATH Keywords

network\(k\)-shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Robust supply chain design under uncertain demand in agile manufacturing

Cites Work

• Unnamed Item
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• Shortest-path algorithms: Taxonomy and annotation
• A New Polynomially Bounded Shortest Path Algorithm
• Shortest‐path methods: Complexity, interrelations and new propositions
• Shortest path methods: A unifying approach
• Computational experience with an algorithm for finding the k shortest paths in a network
• Deterministic network optimization: A bibliography
• Iterative methods for determining the k shortest paths in a network
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem