Introduction to the AMORE project
Modeling Time Table Information Problems as Shortest Paths
Time Table Information and Dynamic All Pairs Shortest Paths
Dynamic Single Source Shortest Paths: Theory and Experimental Results
(continued)
Hierarchical Methods for Solving Shortest Paths Problems in Large Graphs
Shortest Paths for Train Timetabling
Timetabling in Practice
Routing through Railway Stations
Periodic Time Table Generation: Theory and Models
(continued)
Variable Trip Times for Cyclic Railway Timetabling
Optimal Line Plans
(continued)
Line Planning Problems: Hybrid Model and Extensions
Shunting: Practice and Preliminary Models
Cost Optimal Train Schedules
Engine Scheduling and Column Generation