How to find good night train connections
From MaRDI portal
Publication:3076014
DOI10.1002/net.20380zbMath1205.90077WikidataQ57013180 ScholiaQ57013180MaRDI QIDQ3076014
Mathias Schnee, Thorsten Gunkel, Matthias Müller-Hannemann
Publication date: 17 February 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20380
90B50: Management decision making, including multiple objectives
90B90: Case-oriented studies in operations research
90B20: Traffic problems in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time dependency in multiple objective dynamic programming
- On the cardinality of the Pareto set in bicriteria shortest path problems
- The shortest route through a network with time-dependent internodal transit times
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Efficient models for timetable information in public transportation systems
- Minimum weight paths in time-dependent networks
- Dijkstra's algorithm on-line