Robust Algorithms and Price of Robustness in Shunting Problems, Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS07), pp.175-190, 2007. ,

Delay Management Problem: Complexity Results and Robust Algorithms, Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA), pp.458-468, 2008. ,

DOI : 10.1007/978-3-540-85097-7_43

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases, Journal of Combinatorial Optimization, vol.50, issue.1, pp.229-257, 2009. ,

DOI : 10.1007/s10878-009-9247-4

Recoverable Robustness in Shunting and Timetabling, Shunting and Timetabling, pp.28-60, 2009. ,

DOI : 10.1007/978-3-642-05465-5_2

Evaluation of recoverable-robust timetables on tree networks, Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA), pp.24-35, 2009. ,

Recoverable-robust timetables for trains on single-line corridors, Proceedings of the 3rd International Seminar on Railway Operations Modelling and Analysis, 2009. ,

Recoverable Robust Timetabling on Trees, Proceedings of the 3rd ,

Optimization models for the delay management problem in public transportation, European Journal of Operational Research, vol.189, issue.3, pp.762-774, 2007. ,

URL : https://hal.archives-ouvertes.fr/hal-01255554

Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979. ,

Online Delay Management on a Single Train Line, Proceedings of the 4th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS04), volume 4359 of Lecture Notes in Computer Science, pp.306-320, 2007. ,

DOI : 10.1007/978-3-540-74247-0_17

To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation, Transportation Science, vol.41, issue.4, pp.527-538, 2007. ,

DOI : 10.1287/trsc.1070.0212

The ABCs of the Critical Path Method. Graduate School of Business Administration Robust and Online Large-Scale Optimization ? Models and Techniques for Transportation Systems, Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications, pp.1-27, 1963. ,

A Mathematical Model for Periodic Scheduling Problems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.550-581, 1989. ,

DOI : 10.1137/0402049

Angelo is currently a Ph.D. student in the Department of Electrical and Information Engineering of the University of L'Aquila. His research interests are in the area of combinatorial optimization, robust optimization, and graphs algorithms ,

of Rome in 1992 Currently he is associate professor for computer science at the University of L'Aquila; his current research interests include network algorithms, combinatorial optimization, algorithmic graph theory; he is (co-)author of more than 60 publications in journals and international conferences. He had key-participations in several EU funded projects, Among them: MILORD (AIM 2024), COLUM- BUS (IST 2001-38314), AMORE (HPRN-CT-1999-00104), and, recently, ARRIVAL (IST FP6-021235-2) ,