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

DOI10.1016/0893-9659(93)90020-NMaRDI QIDQ1802425zbMATH OpenFDO

Authors A. B. Philpott, Alistair Mees

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)

Recommendations

• Dynamic shortest path problems with time-varying costs
• An approach to the shortest path problem with time-varying
• Continuous-time shortest path problems with stopping and starting costs
• Shortest paths in piecewise continuous time-dependent networks
• Continuous-Time Shortest Path Problems and Linear Programming

Cites work

• 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
• Railway scheduling by network optimization

Cited in

(10)

• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)
• Continuous-time shortest path problems with stopping and starting costs
• Computation of the optimal value function in time-dependent networks
• Dynamic shortest path problems with time-varying costs
• An approach to the shortest path problem with time-varying
• Algorithms for time-dependent bicriteria shortest path problems
• A critical survey on the network optimization algorithms for evacuation planning problems
• A minmax regret version of the time-dependent shortest path problem
• Shortest path algorithms for functional environments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802425)