CalculatingKth Shortest Paths

DOI10.1080/03155986.1973.11731537MaRDI QIDQ5666405zbMATH OpenOpenAlexFDO

Authors

Publication date 1973

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1973.11731537

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(4)

• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• Shortest-path algorithms: Taxonomy and annotation
• An efficient algorithm for K shortest simple paths
• Finding the \(k\) shortest paths in parallel

This page was built for publication: CalculatingKth Shortest Paths

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