CalculatingKth Shortest Paths

DOI10.1080/03155986.1973.11731537zbMath0252.90056OpenAlexW2506596302MaRDI QIDQ5666405

No author found.

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

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

Related Items

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