Paying Less for Train Connections with MOTIS

DOI10.4230/OASIcs.ATMOS.2005.657zbMath1247.90057OpenAlexW1591815036MaRDI QIDQ2917415

Mathias Schnee, Matthias Müller-Hannemann

Publication date: 28 September 2012

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2006/657/pdf/06001.Mueller_HannemannMatthias.Paper.657.pdf

zbMATH Keywords

shortest pathsmulti-criteria optimizationfareslong-distance trafficspecial offerstimetable information system

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (1)

Connection Scan Algorithm

This page was built for publication: Paying Less for Train Connections with MOTIS