Program

Venue: Department of Computer and Systems Sciences

Tuesday, March 11, lecture room B2, ground floor, and meeting room, second floor

• 16:15 - 17:15   PCB+EAB meeting
• 17:15 - 18:15   PCB meeting

• 20:00 Social Dinner (together with the review meeting)

Wednesday, March 12, main lecture hall, first floor

• 09:00 - 09:30   WP6 Meeting
• 09:30 - 10:00   WP5 Meeting
• 10:00 - 10:05   Short Break
• 10:05 - 10:10   Welcome Address
• 10:10 - 10:30   ARRIVAL: Overview and Progress
                          C. Zaroliagis
• 10:30 - 11:00   Coffee break
• 11:00 - 12:00   Invited talk: Martin Skutella
• 12:00 - 12:25   Robust Train Routing
                          L. Kroon, G. Maróti
• 12:25 - 12:50   Towards a dynamic model for the Train Platforming Problem
                          U. Nanni, E. Pulcini, F. Sarracco
• 12:50 - 14:15   Lunch
• 14:15 - 15:15   Invited talk: Pier Luigi Guida
• 15:15 - 15:40   The Complexity of the Shortcut Problem
                          R. Bauer, G. D'Angelo, D. Delling, D. Wagner
• 15:40 - 16:05   Timetable Information Updating in Case of Delays: Modeling Issues
                          D. Delling, K. Giannakopoulou, D. Wagner, C. Zaroliagis
• 16:05 - 16:30   Timetable Information in the Presence of Delays: A Realistic Prototype
                          M. Müller-Hannemann, M. Schnee
• 16:30 - 17:00   Coffee break
• 17:00 - 17:30   General Assembly meeting
• 17:30 - 18:00   WP1 Meeting
• 18:00 - 18:30   WP2 Meeting
• 18:30 - 19:00   WP3 Meeting
• 19:00 - 19:30   WP4 Meeting

Thursday, March 13, main lecture hall, first floor

• 09:00 - 10:00   Invited talk: Dario Pacciarelli
• 10:00 - 10:25   Freight Transportation in Railway Networks
                          V. Cacchiani, A. Caprara, P. Toth
• 10:25 - 10:50   Predicting Delays and Planning Additional Trains
                          H. Flier, M. Nunkesser
• 10:50 - 11:20   Coffee break
• 11:20 - 11:45   Multi-objective Analysis of the Flexible Periodic Event Scheduling Problem
                          G. Caimi, M. Fuchsberger, M. Laumanns
• 11:45 - 12:10   A Stochastic Approach To Reduce the Computational Complexity of Delay Management
                          C. Conte, M. Schachtebeck, A. Schöbel
• 12:10 - 12:35   On the Interaction between Robust Timetable Planning and Delay Management
                          S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra
• 12:35 - 13:00   Recoverable Robust Periodic Timetables
                          C. Liebchen, M. Schachtebeck, A. Schöbel, S. Stiller, A. Prigge
• 13:00 - 14:30   Lunch
• 14:30 - 14:55   Computational Experiments with a Crew Re-Scheduling Algorithm
                          D. Potthoff, J. de Vries, D. Huisman
• 14:55 - 15:20   Rolling stock rescheduling under uncertainty
                          L. K. Nielsen, I. Italiani, L. Kroon, G. Maróti
• 15:20 - 15:45   Building Robust Rolling-Stock Schedules
                          D. De Almeida, N. Marcos, S. Vianey, C. Weber
• 15:45 - 15:55   Short Break
• 15:55 - 16:20   Minimal Infeasible Subsystems and Benders cuts
                          M. Fischetti, D. Salvagnin, A. Zanette
• 16:20 - 16:45   Line Planning, Path Constrained Network Flow and Inapproximability
                          C. Puhl, S. Stiller

Friday, March 14, meeting rooms, first floor

• 09:00 - 17:00   Inter-partner meetings