Efficient algorithms to find optimal paths in a public transportation network

DOI10.1080/02522667.1996.10699302zbMath0874.90076OpenAlexW1964766019MaRDI QIDQ4338573

Andrew E. B. Lim

Publication date: 28 May 1997

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1996.10699302

zbMATH Keywords

directed acyclic graphspublic transportation routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• A note on two problems in connexion with graphs
• An algorithm for ranking paths that may contain cycles
• An algorithm for the ranking of shortest paths

This page was built for publication: Efficient algorithms to find optimal paths in a public transportation network