A finite-time algorithm for shortest path problems with time-varying costs

DOI10.1016/0893-9659(93)90020-NzbMath0770.68095MaRDI QIDQ1802425

Alistair I. Mees, Andy B. Philpott

Publication date: 8 August 1993

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

continuous-time shortest path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Dynamic shortest path problems with time-varying costs ⋮ Unnamed Item ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Computation of the optimal value function in time-dependent networks ⋮ Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

Cites Work

• Railway scheduling by network optimization
• Continuous-time shortest path problems with stopping and starting costs
• Dioïds and semirings: Links to fuzzy sets and other applications
• Minimum weight paths in time-dependent networks

This page was built for publication: A finite-time algorithm for shortest path problems with time-varying costs