Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected

DOI10.4230/OASIcs.ATMOS.2009.2148zbMath1247.90024OpenAlexW1575936991MaRDI QIDQ2917326

Andreas Gebhardt, Annabell Berger, Daniel Delling, Matthias Müller-Hannemann

Publication date: 28 September 2012

Full work available at URL: https://dblp.uni-trier.de/db/conf/atmos/atmos2009.html#BergerDGM09

zbMATH Keywords

contractiontimetable informationtime-dependent networksarc flagsmulti-criteria search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (4)

Trip-Based Public Transit Routing ⋮ Connection Scan Algorithm ⋮ Shortest-path queries in static networks ⋮ User-Constrained Multimodal Route Planning

This page was built for publication: Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected