Time depending shortest-path problems with applications to railway networks
type: Item
instance of: scholarly article
title: Time depending shortest-path problems with applications to railway networks
zbMATH Open document ID: 0903.90054
DOI: 10.1016/0377-2217(94)E0349-G
published in: European Journal of Operational Research
publication date: 1999-01-05T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 1162960
zbMATH Keywords: networks
zbMATH Keywords: shortest paths
zbMATH Keywords: transportation
zbMATH Keywords: rail
zbMATH Keywords: time depending transit network
zbMATH Keywords: public transport
zbMATH Keywords: label correcting method
author: Karl Nachtigall
MaRDI profile type: Publication
cites work: Q3903001
cites work: Minimax algebra
cites work: A New Polynomially Bounded Shortest Path Algorithm
cites work: Shortest path algorithms using dynamic breadth‐first search
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: On a multicriteria shortest path problem
cites work: Symmetric connection problems and their solution by bidirectional search
cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
cites work: Properties of Labeling Methods for Determining Shortest Path Trees
cites work: Linear and combinatorial optimization in ordered algebraic structures
description: scientific article; zbMATH DE number 1162960