Car or Public Transport—Two Worlds

DOI10.1007/978-3-642-03456-5_24zbMath1258.90095OpenAlexW1508854722MaRDI QIDQ3644732

Holger Bast

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_24

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Algorithms in computer science (68W99)

Related Items (2)

Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network ⋮ User-Constrained Multimodal Route Planning

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Fast Routing in Road Networks with Transit Nodes
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Efficient models for timetable information in public transportation systems
• Time-Dependent SHARC-Routing
• SHARC
• Engineering Highway Hierarchies
• Algorithms – ESA 2005
• Experimental and Efficient Algorithms

This page was built for publication: Car or Public Transport—Two Worlds