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

DOI10.1007/BF01919767zbMath0366.90116MaRDI QIDQ4143045

No author found.

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)

Related Items (6)

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

Cites Work

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

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