Round-Based Public Transit Routing

DOI10.1137/1.9781611972924.13zbMath1430.90075OpenAlexW4205437736MaRDI QIDQ5233725

Thomas Pajor, Daniel Delling, Renato F. Werneck

Publication date: 12 September 2019

Published in: 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972924.13

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items (5)

Unnamed Item ⋮ Engineering graph-based models for dynamic timetable information systems ⋮ Connection Scan Algorithm ⋮ Integrating Pareto optimization into dynamic programming ⋮ Unnamed Item

This page was built for publication: Round-Based Public Transit Routing