{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:54:16Z","timestamp":1772754856359,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642054648","type":"print"},{"value":"9783642054655","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05465-5_13","type":"book-chapter","created":{"date-parts":[[2009,10,20]],"date-time":"2009-10-20T15:50:53Z","timestamp":1256053853000},"page":"310-337","source":"Crossref","is-referenced-by-count":22,"title":["Shunting for Dummies: An Introductory Algorithmic Survey"],"prefix":"10.1007","author":[{"given":"Michael","family":"Gatto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Maue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Mathematics - Key Technology for the Future: Joint Projects Between Universities and Industry","author":"R.S. Hansmann","year":"2007","unstructured":"Hansmann, R.S., Zimmermann, U.T.: Optimal sorting of rolling stock at hump yards. In: Mathematics - Key Technology for the Future: Joint Projects Between Universities and Industry. Springer, Heidelberg (2007)"},{"key":"13_CR2","unstructured":"Di Stefano, G., Maue, J., Modelski, M., Navarra, A., Nunkesser, M., van den Broek, J.: Models for rearranging train cars. Technical Report TR-0089, ARRIVAL (2007)"},{"key":"13_CR3","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn. vol.\u00a01. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"13_CR4","unstructured":"Siddiqee, M.W.: Investigation of sorting and train formation schemes for a railroad hump yard. In: Proceedings of the 5th International Symposium on the Theory of Traffic Flow and Transportation, pp. 377\u2013387 (1972)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Jacob, R., M\u00e1rton, P., Maue, J., Nunkesser, M.: Multistage methods for freight train classification. Networks (2009)","DOI":"10.1002\/net.20385"},{"issue":"1-3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0166-218X(99)00219-X","volume":"103","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E., Horak, P., Miller, M., Ryan, J.F.: The train marshalling problem. Discrete Applied Mathematics\u00a0103(1-3), 41\u201354 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR7","unstructured":"Maue, J., Nunkesser, M.: Evaluation of computational methods for freight train classification schedules. Technical Report TR-0184, ARRIVAL (2009)"},{"key":"13_CR8","unstructured":"Jacob, R., Marton, P., Maue, J., Nunkesser, M.: Multistage methods for freight train classification. In: Proceedings of the 7th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS), IBFI Schloss Dagstuhl, pp. 158\u2013174 (2007)"},{"key":"13_CR9","first-page":"15","volume":"22","author":"K. Krell","year":"1962","unstructured":"Krell, K.: Grundgedanken des Simultanverfahrens. ETR RT\u00a022, 15\u201323 (1962)","journal-title":"ETR RT"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/trsc.20.3.189","volume":"20","author":"C.F. Daganzo","year":"1986","unstructured":"Daganzo, C.F.: Static blocking at railyards: Sorting implications and track requirements. Transportation Science\u00a020(3), 189\u2013199 (1986)","journal-title":"Transportation Science"},{"key":"13_CR11","first-page":"114","volume":"13","author":"H. Flandorffer","year":"1953","unstructured":"Flandorffer, H.: Vereinfachte G\u00fcterzugbildung. ETR RT\u00a013, 114\u2013118 (1953)","journal-title":"ETR RT"},{"key":"13_CR12","unstructured":"Pentinga, K.J.: Teaching simultaneous marshalling. The Railway Gazette (1959)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0191-2607(83)90063-8","volume":"17","author":"C.F. Daganzo","year":"1983","unstructured":"Daganzo, C.F., Dowling, R.G., Hall, R.W.: Railroad classification yard throughput: The case of multistage triangular sorting. Transportation Research, Part A\u00a017(2), 95\u2013106 (1983)","journal-title":"Transportation Research, Part A"},{"key":"13_CR14","unstructured":"Dahlhaus, E., Manne, F., Miller, M., Ryan, J.: Algorithms for combinatorial problems related to train marshalling. In: Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (AWOCA), pp. 7\u201316 (2000)"},{"key":"13_CR15","unstructured":"M\u00e1rton, P., Maue, J., Nunkesser, M.: An improved classification procedure for the hump yard Lausanne Triage. In: Proceedings of the 9th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS), Wadern, Germany, IBFI Schloss Dagstuhl (2009)"},{"key":"13_CR16","unstructured":"Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D., Navarra, A.: Robust algorithms and price of robustness in shunting problems. In: Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), Wadern, Germany, IBFI Schloss Dagstuhl, pp. 175\u2013190 (2007)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-05465-5_2","volume-title":"Robust and Online Large-Scale Optimization","author":"S. Cicerone","year":"2009","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A., Schachtebeck, M., Sch\u00f6bel, A.: Recoverable robustness in shunting and timetabling. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 28\u201360. Springer, Heidelberg (2009)"},{"key":"13_CR18","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R.H., Stiller, S.: Recoverable robustness. Technical Report TR-0066, ARRIVAL (2007)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-05465-5_1","volume-title":"Robust and Online Large-Scale Optimization","author":"C. Liebchen","year":"2009","unstructured":"Liebchen, C., L\u00fcebbecke, M., M\u00f6hring, R.H., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 1\u201327. Springer, Heidelberg (2009)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Even, S., Itai, A.: Queues, stacks and graphs. In: Proceedings of an International Symposium on the Theory of Machines and Computations, pp. 71\u201386 (1971)","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Sorting using networks of queues and stacks. Journal of the ACM\u00a019(2), 341\u2013346 (1972)","journal-title":"Journal of the ACM"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Computing permutations with double-ended queues, parallel stacks and parallel queues. In: Proceedings of the fifth annual ACM symposium on Theory of computing (STOC), pp. 268\u2013277 (1973)","DOI":"10.1145\/800125.804058"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"B\u00f3na, M.: A survey of stack-sorting disciplines. The Electronic Journal of Combinatorics\u00a09(2) (2003)","DOI":"10.37236\/1693"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/978-3-540-92182-0_78","volume-title":"Algorithms and Computation","author":"F.G. K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, F.G., L\u00fcbbecke, M.E.: Sorting with complete networks of stacks. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 895\u2013906. Springer, Heidelberg (2008)"},{"issue":"1","key":"13_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/PL00020912","volume":"49","author":"U. Blasum","year":"1999","unstructured":"Blasum, U., Bussieck, M.R., Hochst\u00e4ttler, W., Moll, C., Scheel, H.H., Winter, T.: Scheduling trams in the morning. Mathematical Methods of Operations Research\u00a049(1), 137\u2013148 (1999)","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1-4","key":"13_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1018907720194","volume":"96","author":"T. Winter","year":"2000","unstructured":"Winter, T., Zimmermann, U.T.: Real-time dispatch in storage yards. Annals of Operations Research\u00a096(1-4), 287\u2013315 (2000)","journal-title":"Annals of Operations Research"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.entcs.2003.12.020","volume":"92","author":"G. Stefano Di","year":"2004","unstructured":"Di Stefano, G., Ko\u010di, M.L.: A graph theoretical approach to the shunting problem. Electronic Notes in Theoretical Computer Science\u00a092, 16\u201333 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. The Annals of Mathematics\u00a051(1), 161\u2013166 (1950)","journal-title":"The Annals of Mathematics"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.jda.2008.01.002","volume":"6","author":"G. Stefano Di","year":"2008","unstructured":"Di Stefano, G., Krause, S., L\u00fcbbecke, M.E., Zimmermann, U.T.: On minimum k-modal partitions of permutations. Journal of Discrete Algorithms\u00a06, 381\u2013392 (2008)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks\u00a03(3), 261\u2013273 (1973)","journal-title":"Networks"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.endm.2008.01.037","volume":"30","author":"M. Demange","year":"2008","unstructured":"Demange, M., Di Stefano, G., Leroy-Beaulieu, B.: Online bounded coloring of permutation and overlap graphs. Electronic Notes in Discrete Mathematics\u00a030, 213\u2013218 (2008); (Proceedings of the IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS))","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"13_CR32","unstructured":"Leroy-Beaulieu, B.: Some coloring and walking problems in graphs. PhD thesis, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland (2008)"},{"key":"13_CR33","unstructured":"Demange, M., Di Stefano, G., Leroy-Beaulieu, B.: On the online track assignment problem. Technical report, ARRIVAL (2006)"}],"container-title":["Lecture Notes in Computer Science","Robust and Online Large-Scale Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05465-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T03:09:34Z","timestamp":1685156974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05465-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054648","9783642054655"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05465-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}