{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T15:55:33Z","timestamp":1765554933964},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,6]],"date-time":"2013-09-06T00:00:00Z","timestamp":1378425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00291-013-0341-8","type":"journal-article","created":{"date-parts":[[2013,9,5]],"date-time":"2013-09-05T11:59:14Z","timestamp":1378382354000},"page":"631-668","source":"Crossref","is-referenced-by-count":36,"title":["Robust load planning of trains in intermodal transportation"],"prefix":"10.1007","volume":"36","author":[{"given":"Florian","family":"Bruns","sequence":"first","affiliation":[]},{"given":"Marc","family":"Goerigk","sequence":"additional","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]},{"given":"Anita","family":"Sch\u00f6bel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,6]]},"reference":[{"key":"341_CR1","doi-asserted-by":"crossref","unstructured":"Alvarez PP, Vera JR (2011) Application of robust optimization to the sawmill planning problem. Ann Oper Res 1\u201319. doi: 10.1007\/s10479-011-1002-4","DOI":"10.1007\/s10479-011-1002-4"},{"key":"341_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton and Oxford"},{"key":"341_CR3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2003","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2003) Adjustable robust solutions of uncertain linear programs. Math Program A 99:351\u2013376","journal-title":"Math Program A"},{"issue":"4","key":"341_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769\u2013805","journal-title":"Math Oper Res"},{"key":"341_CR5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program A 88:411\u2013424","journal-title":"Math Program A"},{"issue":"1","key":"341_CR6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.1110.0482","volume":"36","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Goyal V, Sun XA (2011) A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization. Math Oper Res 36(1):24\u201354","journal-title":"Math Oper Res"},{"issue":"1","key":"341_CR7","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":"341_CR8","doi-asserted-by":"crossref","unstructured":"Bessas A, Kontogiannis S, Zaroliagis C (2011) Robust line planning in case of multiple pools and disruptions. In: Marchetti-Spaccamela A, Segal M (eds) Theory and practice of algorithms in (Computer) systems. Lecture Notes in Computer Science, vol 6595 , Springer, Berlin, pp 33\u201344","DOI":"10.1007\/978-3-642-19754-3_6"},{"issue":"1","key":"341_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tra.2003.06.001","volume":"38","author":"YM Bontekoning","year":"2004","unstructured":"Bontekoning YM, Macharis C, Trip JJ (2004) Is a new applied transportation research field emerging? A review of intermodal rail-truck freight transport literature. Transp Res Part A Policy Pract 38(1):1\u201334","journal-title":"Transp Res Part A Policy Pract"},{"key":"341_CR10","doi-asserted-by":"crossref","unstructured":"Boysen N, Fliedner M, Jaehn F, Pesch E (2013) A survey on container processing in railway yards. Transp Sci. doi: 10.1287\/trsc.1120.0415","DOI":"10.1287\/trsc.1120.0415"},{"key":"341_CR11","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00291-010-0232-1","volume":"34","author":"F Bruns","year":"2012","unstructured":"Bruns F, Knust S (2012) Optimized load planning of trains in intermodal transportation. OR Spectr 34:511\u2013533","journal-title":"OR Spectr"},{"key":"341_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s001860300294","volume":"58","author":"E Carrizosa","year":"2003","unstructured":"Carrizosa E, Nickel S (2003) Robust facility location. Math Methods Oper Res 58:331\u2013349","journal-title":"Math Methods Oper Res"},{"issue":"2","key":"341_CR13","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1287\/opre.1080.0650","volume":"57","author":"AL Erera","year":"2009","unstructured":"Erera AL, Morales JC, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper Res 57(2):468\u2013483","journal-title":"Oper Res"},{"key":"341_CR14","doi-asserted-by":"crossref","unstructured":"Fischetti M, Monaci M (2009) Light robustness. In: Ahuja RK, M\u00f6hring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Lecture notes in computer science, vol 5868. Springer, Berlin, pp 61\u201384","DOI":"10.1007\/978-3-642-05465-5_3"},{"key":"341_CR15","volume-title":"Computers and intractability\u2014a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability\u2014a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"341_CR16","unstructured":"Goerigk M, Knoth M, M\u00fcller-Hannemann M, Schmidt M, Sch\u00f6bel A (2011) The price of robustness in timetable information. In: Caprara A, Kontogiannis S (eds) Proceedings of ATMOS11, vol 20. Open Access Series in Informatics (OASIcs)Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Germany, pp 76\u201387"},{"key":"341_CR17","unstructured":"Goerigk M, Sch\u00f6bel A (2010) An empirical analysis of robustness concepts for timetabling. In: Erlebach T, L\u00fcbbecke M (eds) Proceedings of ATMOS10, vol 14. OpenAccess Series in Informatics (OASIcs)Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Germany, pp 100\u2013113"},{"key":"341_CR18","unstructured":"Goerigk M, Sch\u00f6bel A (2012) A note on the relation between strict robustness and adjustable robustness. Institute for Numerical and Applied Mathematics, University of G\u00f6ttingen, Technical report"},{"key":"341_CR19","doi-asserted-by":"crossref","unstructured":"Liebchen C, L\u00fcbbecke M, M\u00f6hring RH, Stiller S (2009) The concept of recoverable robustness, linear programming recoery, and railway applications. In: Ahuja RK, M\u00f6hring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Lecture notes in computer science, vol 5868. Springer, Berlin","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"341_CR20","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21:1154\u20131157","journal-title":"Oper Res"},{"issue":"1","key":"341_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R Stahlbock","year":"2008","unstructured":"Stahlbock R, Voss S (2008) Operations research at container terminals: a literature update. OR Spectr 30(1):1\u201352","journal-title":"OR Spectr"},{"key":"341_CR22","doi-asserted-by":"crossref","unstructured":"Subramani K (2004) Analyzing selected quantified integer programs. In: David B, Micha\u00ebl R (eds) Automated Reasoning. Lecture notes in computer science, vol 3097. Springer, Berlin, pp 342\u2013356","DOI":"10.1007\/978-3-540-25984-8_26"},{"key":"341_CR23","unstructured":"WASCOSA AG Luzern, Doppeltaschenwagen T2000. http:\/\/www.txlogistik.eu\/assets\/Uploads\/WASCOSA-Doppeltaschenwagen-T2000.pdf . Accessed August 2013."}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0341-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-013-0341-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0341-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:00:04Z","timestamp":1559041204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-013-0341-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["341"],"URL":"https:\/\/doi.org\/10.1007\/s00291-013-0341-8","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,6]]}}}