Dynamic algorithms for recoverable robustness problems

OpenAccess Series in Informatics

Volumn 9, Issue , 2008, Pages

  Cicerone, S ^a   Di Stefano, G ^a   Schachtebeck, M ^b   Schobel A ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Delay management; Dynamic algorithms; Optimization problems; Robustness; Timetabling

Indexed keywords

DELAY MANAGEMENT; DYNAMIC ALGORITHM; INPUT DATAS; OPERATIONAL PHASE; OPTIMIZATION PROBLEMS; ROBUST ALGORITHM; TIMETABLING; TIMETABLING PROBLEM;

ALGORITHMS; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

PROBLEM SOLVING;

EID: 84882963402     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. H. G. Bayer and B. Sendhoff. Robust Optimization - A Comprehensive Survey. Computer Methods in Applied Mechanics and Engineering, 196(33-34):3190-3218, 2007.
2. A. Ben-Tal, L. El Ghaoui, and A. Nemirovski. Mathematical Programming: Special Issue on Robust Optimization, volume 107. Springer, Berlin, 2006.
3. D. Bertsimas and M. Sim. The price of robustness. Operations Research, 52(1):35-53, 2004.
4. J.R. Birge and F.V. Louveaux. Introduction to Stochastic Programming. Springer Verlag, New York, 1997.
5. A. Borodin and R. El-Yaniv, editors. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Robust Algorithms and Price of Robustness in Shunting Problems. In Proc. of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS07), 2007.
7. M. Fischetti and M. Monaci. Robust optimization through branch-and-price. In Proceedings of the 37th Annual Conference of the Italian Operations Research Society (AIRO), 2006.
8. M. Fischetti and M. Monaci. Light robustness. Research Paper ARRIVAL-TR-0066, ARRIVAL project, 2008.
9. M. Gatto, B. Glaus, R. Jacob, L. Peeters, and P. Widmayer. Railway delay management: Exploring its algorithmic complexity. In Algorithm Theory - Proceedings SWAT 2004, volume 3111 of LNCS, pages 199-211. Springer, 2004.
10. M. Gatto, R. Jacob, L. Peeters, and A. Schöbel. The Computational Complexity of Delay Management. In Proc. of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 3787 of Lecture Notes in Computer Science, 2005.
11. M. Gatto, R. Jacob, L. Peeters, and P. Widmayer. Online Delay Management on a Single Train Line. In Proc. of the Algorithmic Methods for Railway Optimization (ATMOS04), volume 4359 of Lecture Notes in Computer Science, 2007.
12. A. Ginkel and A. Schöbel. The bicriteria delay management problem. Transportation Science, 41(4):527-538, 2007.
13. L. Giovanni, G. Heilporn, and M. Labbé. Optimization models for the delay management problem in public transportation. European Journal of Operational Research, 2006. to appear.
14. P. Kall and S.W. Wallace. Stochastic Programming. Wiley, Chichester, 1994.
15. C. Liebchen, M. Lüebbecke, R. H. Möhring, and S. Stiller. Recoverable robustness. Technical Report ARRIVAL-TR-0066, ARRIVAL Project, 2007.
16. A. Ruszczynski and A. Shapiro, editors. Stochastic Programming, Handbooks in Operations Research and Management Science Volume 10. North-Holland, 2003.
17. A. Schöbel. A model for the delay management problem based on mixed integer programming. Electronic Notes in Theoretical Computer Science, 50(1), 2001.
18. A. Schöbel. Book Chapter: Integer programming approaches for solving the delay management problem. volume 4359 of Lecture Notes in Computer Science, pages 145-170, 2007.