Continuous-time shortest path problems with stopping and starting costs
type: Item
instance of: scholarly article
title: Continuous-time shortest path problems with stopping and starting costs
zbMATH Open document ID: 0758.90076
DOI: 10.1016/0893-9659(92)90066-I
published in: Applied Mathematics Letters
publication date: 1993-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 85875
zbMATH Keywords: shortest path
zbMATH Keywords: transit time
zbMATH Keywords: stopping
zbMATH Keywords: parking
author: A. B. Philpott
author: Alistair Mees
MaRDI profile type: Publication
cites work: Railway scheduling by network optimization
cites work: Minimum weight paths in time-dependent networks
cites work: The shortest route through a network with time-dependent internodal transit times
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Shortest route with time dependent length of edges and limited delay possibilities in nodes
cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
cites work: Multiple-objective approximation of feasible but unsolvable linear complementarity problems
description: scientific article; zbMATH DE number 85875