{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:06Z","timestamp":1725603666358},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_20","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"227-238","source":"Crossref","is-referenced-by-count":8,"title":["Passenger Flow-Oriented Train Disposition"],"prefix":"10.1007","author":[{"given":"Annabell","family":"Berger","sequence":"first","affiliation":[]},{"given":"Christian","family":"Blaar","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Gebhardt","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Schnee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-74247-0_7","volume-title":"Algorithmic Methods for Railway Optimization","author":"A. Sch\u00f6bel","year":"2007","unstructured":"Sch\u00f6bel, A.: Integer programming approaches for solving the delay management problem. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Algorithmic Methods for Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 145\u2013170. Springer, Heidelberg (2007)"},{"key":"20_CR2","unstructured":"Berger, A., Gebhardt, A., M\u00fcller-Hannemann, M., Ostrowski, M.: Stochastic delay prediction in large train networks. Technical Report 2011\/1, Institut f\u00fcr Informatik, Martin-Luther-Universit\u00e4t Halle-Wittenberg (2011)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.trb.2006.02.007","volume":"41","author":"L.E. Meester","year":"2007","unstructured":"Meester, L.E., Muns, S.: Stochastic delay propagation in railway networks and phase-type distributions. Transportation Research Part B\u00a041, 218\u2013230 (2007)","journal-title":"Transportation Research Part B"},{"key":"20_CR4","unstructured":"Yuan, J.: Stochastic modeling of train delays and delay propagation in stations. PhD thesis. Technische Universiteit Delft, The Netherlands (2006)"},{"key":"20_CR5","unstructured":"van der Meer, D., Goverde, R., Hansen, I.: Prediction of train running times and conflicts using track occupation data. In: Proceedings of 12th WCTR (2010)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-27810-8_18","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Gatto","year":"2004","unstructured":"Gatto, M., Glaus, B., Jacob, R., Peeters, L., Widmayer, P.: Railway delay management: Exploring its algorithmic complexity. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 199\u2013211. Springer, Heidelberg (2004)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/11604686_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Gatto","year":"2005","unstructured":"Gatto, M., Jacob, R., Peeters, L., Sch\u00f6bel, A.: The computational complexity of delay management. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 227\u2013238. Springer, Heidelberg (2005)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1287\/trsc.1100.0318","volume":"44","author":"M. Schachtebeck","year":"2010","unstructured":"Schachtebeck, M., Sch\u00f6bel, A.: To wait or not to wait - and who goes first? Delay management with priority decisions. Transportation Science\u00a044, 307\u2013321 (2010)","journal-title":"Transportation Science"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/trsc.1070.0212","volume":"41","author":"A. Ginkel","year":"2007","unstructured":"Ginkel, A., Sch\u00f6bel, A.: To wait or not to wait? The bicriteria delay management problem in public transportation. Transportation Science\u00a041, 527\u2013538 (2007)","journal-title":"Transportation Science"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-05465-5_10","volume-title":"Robust and Online Large-Scale Optimization","author":"M. M\u00fcller-Hannemann","year":"2009","unstructured":"M\u00fcller-Hannemann, M., Schnee, M.: Efficient timetable information in the presence of delays. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 249\u2013272. Springer, Heidelberg (2009)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Berger, A., Blaar, C., Gebhardt, A., M\u00fcller-Hannemann, M., Schnee, M.: Passenger flow-oriented train disposition. Technical Report 2011\/2, Institut f\u00fcr Informatik, Martin-Luther-Universit\u00e4t Halle-Wittenberg (2011)","DOI":"10.1007\/978-3-642-23719-5_20"},{"key":"20_CR12","unstructured":"Schnee, M.: Fully realistic multi-criteria timetable information systems. PhD thesis, Fachbereich Informatik, Technische Universit\u00e4t Darmstadt (2009)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-13193-6_4","volume-title":"Experimental Algorithms","author":"A. Berger","year":"2010","unstructured":"Berger, A., Grimmer, M., M\u00fcller-Hannemann, M.: Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 35\u201346. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:33Z","timestamp":1560514113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}