scientific article; zbMATH DE number 1114039

zbMATH Open0886.05105MaRDI QIDQ4375808FDOQ4375808

Authors:

Publication date: 4 May 1998

Title of this publication is not available (Why is that?)

Recommendations

• Time-varying shortest path problems with constraints
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Shortest paths in piecewise continuous time-dependent networks
• Time-dependent shortest paths with discounted waits

zbMATH Keywords

shortest path problemcosttransit timewaiting times

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cited In (15)

• Minimization of travel time and weighted number of stops in a traffic-light network
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Continuous-time shortest path problems with stopping and starting costs
• Variants of shortest path problems
• A shortest path routing problem with resource allocation
• Shortest path problems with left-side time windows
• A dynamic programming solution of a shortest path problem with time constraints on movement and parking
• The quickest path problem with batch constraints.
• Time-dependent shortest paths with discounted waits
• Time-dependent shortest path problems with penalties and limits on waiting
• Minimum time paths in a network with mixed time constraints.
• Network reduction for the acyclic constrained shortest path problem
• Shortest path with acceleration constraints: complexity and approximation algorithms
• Title not available (Why is that?)
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

This page was built for publication:

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