Continuous-time shortest path problems with stopping and starting costs

DOI10.1016/0893-9659(92)90066-IzbMath0758.90076MaRDI QIDQ1195684

Alistair I. Mees, Andy B. Philpott

Publication date: 5 January 1993

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

shortest pathparkingstoppingtransit time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Dynamic shortest path problems with time-varying costs ⋮ Unnamed Item ⋮ A finite-time algorithm for shortest path problems with time-varying costs ⋮ Computation of the optimal value function in time-dependent networks

Cites Work

• Railway scheduling by network optimization
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• The shortest route through a network with time-dependent internodal transit times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Shortest route with time dependent length of edges and limited delay possibilities in nodes
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Continuous-time shortest path problems with stopping and starting costs