Recoverable robust timetables on trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5573 LNCS, Issue , 2009, Pages 451-462

  D'Angelo, Gianlorenzo ^a   Di Stefano, Gabriele ^a   Navarra, Alfredo ^b   Pinotti, Cristina M ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; NEW CONCEPT; NP-HARD; ON DYNAMICS; OPERATIONAL PHASE; OPTIMAL SOLUTIONS; PLANNING PHASE; POLYNOMIAL-TIME ALGORITHMS; RE-SCHEDULING; RUNTIMES; THEORETICAL POINTS; TIMETABLING;

BEVERAGES; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SYSTEMS ENGINEERING;

DYNAMIC PROGRAMMING;

EID: 70350655433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02026-1_43     Document Type: Conference Paper

References (15)

1. Cicerone, S., D'Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A.: Robust Algorithms and Price of Robustness in Shunting Problems. In: Proc. of 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS, pp. 175-190 (2007)
2. Cicerone, S., D'Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A.: Delay Management Problem: Complexity Results and Robust Algorithms. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 458-468. Springer, Heidelberg (2008)
3. Cicerone, S., D'Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A.: Recoverable Robust Timetabling: Complexity Results and Algorithms. ARRIVAL-TR-0172, ARRIVAL Project (2008)
4. Cicerone, S., Di Stefano, G., Schachtebeck, M., Schöbel, A.: Dynamic Algorithms for Recoverable Robustness Problems. In: The 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS (2008)
5. D'Angelo, G., Di Stefano, G., Navarra, A.: A Dynamic Programming Approach for Recoverable Robust Timetables on Trees. ARRIVAL-TR-0217, ARRIVAL Project (2009)
6. D'Angelo, G., Di Stefano, G., Navarra, A.: Recoverable-Robust Timetables for Trains on Single-Line Corridors. In: The 3rd International Seminar on Railway Operations Modelling and Analysis, RailZurich (2009)
7. D'Angelo, G., Di Stefano, G., Navarra, A.: Recoverable Robust Timetables on Trees. ARRIVAL-TR-0163, ARRIVAL Project (2008)
8. De Giovanni, L., Heilporn, G., Labbé, M.: Optimization Models for the Delay Management Problem in Public Transportation. European Journal of Operational Research 189(3), 762-774 (2007)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
10. Gatto, M., Jacob, R., Peeters, L., Widmayer, P.: Online Delay Management on a Single Train Line. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 306-320. Springer, Heidelberg (2007)
11. Ginkel, A., Schöbel, A.: The Bicriteria Delay Management Problem. Transportation Science 4(41), 527-538 (2007)
12. Levy, F.K., Thompson, G.L., Wies, J.D.: The ABCs of the Critical Path Method. Graduate School of Business Administration, Harvard University (1963)
13. Liebchen, C., Lübbecke, M., Möhring, R.H., Stiller, S.: Recoverable Robustness. ARRIVAL-TR-0066, ARRIVAL Project (2007)
14. Schöbel, A.: A Model for the Delay Management Problem Based on Mixed Integer Programming. ENTCS 50(1), 1-10 (2004)
15. Schöbel, A.: Integer Programming Approaches for Solving the Delay Management. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 145-170. Springer, Heidelberg (2007)