How to find good night train connections
From MaRDI portal
Publication:3076014
Recommendations
Cites work
- scientific article; zbMATH DE number 1488066 (Why is no real title available?)
- Dijkstra's algorithm on-line
- Efficient models for timetable information in public transportation systems
- Minimum weight paths in time-dependent networks
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- The shortest route through a network with time-dependent internodal transit times
- Time dependency in multiple objective dynamic programming
- Time-dependent networks as models to achieve fast exact time-table queries
- Towards realistic modeling of time-table information through the time-dependent approach
Cited in
(3)
This page was built for publication: How to find good night train connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076014)