Computingk-shortest path lengths in euclidean networks

DOI10.1002/net.3230170308zbMath0646.90083OpenAlexW1966557890MaRDI QIDQ3790962

Bruce L. Golden, Christopher C. Skiscim

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

adaptive algorithmDijkstra algorithmk-shortest pathsorigin and destination pair

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (2)

Solving k-shortest and constrained shortest path problems efficiently ⋮ On finding dissimilar paths

Cites Work

• Unnamed Item

This page was built for publication: Computingk-shortest path lengths in euclidean networks