Near optimum paths in time-table graphs
From MaRDI portal
Publication:3568804
zbMATH Open1201.94158MaRDI QIDQ3568804FDOQ3568804
Authors: Ioan Cozac 
Publication date: 15 June 2010
Recommendations
- Time-dependent networks as models to achieve fast exact time-table queries
- Towards realistic modeling of time-table information through the time-dependent approach
- Efficient models for timetable information in public transportation systems
- Engineering Time-Expanded Graphs for Faster Timetable Information
- Engineering time-expanded graphs for faster timetable information
Cited In (7)
- Title not available (Why is that?)
- Some optimization problems for timed marked graphs
- Time-dependent networks as models to achieve fast exact time-table queries
- Towards realistic modeling of time-table information through the time-dependent approach
- Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
- Paying less for train connections with MOTIS
- How to find good night train connections
This page was built for publication: Near optimum paths in time-table graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568804)
