A note on the problem of updating shortest paths

DOI10.1002/net.3230110309zbMath0462.68043OpenAlexW2059547694MaRDI QIDQ3912036

Satoru Fujishige

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

Dijkstra method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (4)

Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price ⋮ A reoptimization algorithm for the shortest path problem with time windows ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ A new algorithm for reoptimizing shortest paths when the arc costs change

This page was built for publication: A note on the problem of updating shortest paths