{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:56:01Z","timestamp":1762210561009},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T00:00:00Z","timestamp":1250640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10878-009-9247-4","type":"journal-article","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T16:30:21Z","timestamp":1250613021000},"page":"229-257","source":"Crossref","is-referenced-by-count":26,"title":["Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases"],"prefix":"10.1007","volume":"18","author":[{"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[]},{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,19]]},"reference":[{"issue":"33\u201334","key":"9247_CR1","doi-asserted-by":"crossref","first-page":"3190","DOI":"10.1016\/j.cma.2007.03.003","volume":"196","author":"HG Bayer","year":"2007","unstructured":"Bayer HG, Sendhoff B (2007) Robust optimization\u2014a comprehensive survey. Comput Methods Appl Mech Eng 196(33\u201334):3190\u20133218","journal-title":"Comput Methods Appl Mech Eng"},{"key":"9247_CR2","volume-title":"Mathematical programming: special issue on robust optimization","author":"A Ben-Tal","year":"2006","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2006) Mathematical programming: special issue on robust optimization, vol\u00a0107. Springer, Berlin"},{"issue":"1","key":"9247_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"key":"9247_CR4","unstructured":"Cicerone S, D\u2019Angelo G, Di Stefano G, Frigioni D, Navarra A (2007) Robust algorithms and price of robustness in shunting problems. In: Proc of the 7th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS\u201907), pp\u00a0175\u2013190"},{"key":"9247_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/978-3-540-85097-7_43","volume-title":"Proc of 2nd annual international conference on combinatorial optimization and applications (COCOA\u201908)","author":"S Cicerone","year":"2008","unstructured":"Cicerone S, D\u2019Angelo G, Di Stefano G, Frigioni D, Navarra A (2008) Delay management problem: Complexity results and robust algorithms. In: Proc of 2nd annual international conference on combinatorial optimization and applications (COCOA\u201908). Lecture notes in computer science, vol\u00a05165. Springer, Berlin, pp\u00a0458\u2013468"},{"issue":"3","key":"9247_CR6","first-page":"762","volume":"189","author":"L Giovanni De","year":"2007","unstructured":"De Giovanni L, Heilporn G, Labb\u00e9 M (2007) Optimization models for the delay management problem in public transportation. Eur J Oper Res 189(3):762\u2013774","journal-title":"Eur J Oper Res"},{"key":"9247_CR7","unstructured":"Fischetti M, Monaci M (2006) Robust optimization through branch-and-price. In: Proceedings of the 37th annual conference of the Italian operations research society (AIRO)"},{"key":"9247_CR8","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9247_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-27810-8_18","volume-title":"Proc of the 9th Scandinavian workshop on algorithm theory (SWAT)","author":"M Gatto","year":"2004","unstructured":"Gatto M, Glaus B, Jacob R, Peeters L, Widmayer P (2004) Railway delay management: Exploring its algorithmic complexity. In: Proc of the 9th Scandinavian workshop on algorithm theory (SWAT). Lecture notes in computer science, vol\u00a03111. Springer, Berlin, pp\u00a0199\u2013211"},{"key":"9247_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/11604686_20","volume-title":"Proc of the 31st international workshop on graph-theoretic concepts in computer science (WG)","author":"M Gatto","year":"2005","unstructured":"Gatto M, Jacob R, Peeters L, Sch\u00f6bel A (2005) The computational complexity of delay management. In: Proc of the 31st international workshop on graph-theoretic concepts in computer science (WG). Lecture notes in computer science, vol\u00a03787. Springer, Berlin, pp\u00a0227\u2013238"},{"key":"9247_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-540-74247-0_17","volume-title":"Proc. of the algorithmic methods for railway optimization (ATMOS\u201904)","author":"M Gatto","year":"2007","unstructured":"Gatto M, Jacob R, Peeters L, Widmayer P (2007) Online delay management on a single train line. In: Proc. of the algorithmic methods for railway optimization (ATMOS\u201904). Lecture notes in computer science, vol\u00a04359. Springer, Berlin, pp\u00a0306\u2013320"},{"issue":"4","key":"9247_CR12","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/trsc.1070.0212","volume":"41","author":"A Ginkel","year":"2007","unstructured":"Ginkel A, Sch\u00f6bel A (2007) The bicriteria delay management problem. Transp Sci 41(4):527\u2013538","journal-title":"Transp Sci"},{"key":"9247_CR13","unstructured":"Levy F, Thompson G, Wies J (1963) The ABCs of the critical path method. Graduate School of Business Administration, Harvard University"},{"key":"9247_CR14","unstructured":"Liebchen C, L\u00fcebbecke M, M\u00f6hring RH, Stiller S (2007) Recoverable robustness. Tech Rep ARRIVAL-TR-0066, ARRIVAL Project"},{"issue":"1","key":"9247_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s12469-008-0004-3","volume":"1","author":"C Liebchen","year":"2008","unstructured":"Liebchen C, Stiller S (2008) Delay resistant timetabling. Public Transp 1(1):55\u201372","journal-title":"Public Transp"},{"issue":"1","key":"9247_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S1571-0661(04)00160-4","volume":"50","author":"A Sch\u00f6bel","year":"2004","unstructured":"Sch\u00f6bel A (2004) A model for the delay management problem based on mixed integer programming. Electron Notes Theor Comput Sci 50(1):1\u201310","journal-title":"Electron Notes Theor Comput Sci"},{"key":"9247_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-540-74247-0_7","volume-title":"Proc of the algorithmic methods for railway optimization (ATMOS\u201904)","author":"A Sch\u00f6bel","year":"2007","unstructured":"Sch\u00f6bel A (2007) Integer programming approaches for solving the delay management problem. In: Proc of the algorithmic methods for railway optimization (ATMOS\u201904). Lecture notes in computer science, vol\u00a04359. Springer, Berlin, pp\u00a0145\u2013170"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9247-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9247-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9247-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:14Z","timestamp":1559261894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9247-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,19]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9247"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9247-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,19]]}}}