Shortest route with time dependent length of edges and limited delay possibilities in nodes

DOI10.1007/BF01919767zbMATH Open0366.90116MaRDI QIDQ4143045FDOQ4143045

Author name not available (Why is that?)

Publication date: 1977

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites Work

• An Appraisal of Some Shortest-Path Algorithms
• The shortest route through a network with time-dependent internodal transit times

Cited In (6)

• On continuous network flows
• An axiomatic approach to time-dependent shortest path oracles
• A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
• Continuous-time shortest path problems with stopping and starting costs
• Dynamic programming and minimum risk paths
• Vehicle dispatching with time-dependent travel times

This page was built for publication: Shortest route with time dependent length of edges and limited delay possibilities in nodes

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