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

DOI10.1016/0893-9659(93)90020-NzbMATH Open0770.68095MaRDI QIDQ1802425FDOQ1802425

Alistair Mees, A. 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)

Cites Work

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

Cited In (8)

• Computation of the optimal value function in time-dependent networks
• Title not available (Why is that?)
• Continuous-time shortest path problems with stopping and starting costs
• A minmax regret version of the time-dependent shortest path problem
• Dynamic shortest path problems with time-varying costs
• Title not available (Why is that?)
• Algorithms for time-dependent bicriteria shortest path problems
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

Recommendations

• Dynamic shortest path problems with time-varying costs 👍 👎
• Shortest paths in piecewise continuous time-dependent networks 👍 👎
• Continuous-Time Shortest Path Problems and Linear Programming 👍 👎
• Continuous-time shortest path problems with stopping and starting costs 👍 👎
• Title not available (Why is that?) 👍 👎

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)