Showing 1 - 1 of 1
In this paper, we study dynamic shortest path problems that determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: the minimum time walk problem and the minimum cost walk problem. The minimum...
Persistent link: https://www.econbiz.de/10005587464