{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:12:00Z","timestamp":1725495120757},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45678-3_34","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:12:14Z","timestamp":1195125134000},"page":"390-402","source":"Crossref","is-referenced-by-count":9,"title":["On the Complexity of Train Assignment Problems"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"given":"Martin","family":"Gantenbein","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"H\u00fcrlimann","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Neyer","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[]},{"given":"Konrad","family":"Schlude","sequence":"additional","affiliation":[]},{"given":"Kathleen","family":"Steinh\u00f6fel","sequence":"additional","affiliation":[]},{"given":"David Scot","family":"Taylor","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"34_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Hardness of approximating problems on cubic graphs","author":"P. Alimonti","year":"1997","unstructured":"P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd Italian Conference on Algorithms and Complexity, LNCS 1203, pages 288\u2013298, Berlin, 1997. Springer-Verlag."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/net.3230170303","volume":"17","author":"A. Bertossi","year":"1987","unstructured":"A. Bertossi, P. Carraresi, and G. Gallo. On some matching problems arising in vehicle scheduling models. Networks, 17:271\u2013281, 1987.","journal-title":"Networks"},{"key":"34_CR3","unstructured":"P. Brucker, J.L. Hurink, and T. Rolfes. Routing of railway carriages: A case study. Memorandum No. 1498, University of Twente, Fac. of Mathematical Sciences, 1999."},{"key":"34_CR4","first-page":"415","volume":"79","author":"M.R. Bussieck","year":"1997","unstructured":"M.R. Bussieck, T. Winter, and U.T. Zimmermann. Discrete optimization in public rail transport. Mathematical Programming, 79:415\u2013444, 1997.","journal-title":"Mathematical Programming"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"G. Carpaneto","year":"1989","unstructured":"G. Carpaneto, M. Dell\u2019Amico, M. Fischetti, and P. Toth. A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks, 19:531\u2013548, 1989.","journal-title":"Networks"},{"key":"34_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-58715-2_135","volume-title":"On approximation scheme preserving reducibility and its applications","author":"P. Crescenzi","year":"1994","unstructured":"P. Crescenzi and L. Trevisan. On approximation scheme preserving reducibility and its applications. In Proc. 14th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 880, pages 330\u2013341, Berlin, 1994. Springer-Verlag."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/nav.3800010309","volume":"1","author":"G. Dantzig","year":"1954","unstructured":"G. Dantzig and D. Fulkerson. Minimizing the number of tankers to meet a fixed schedule. Nav. Res. Logistics Q., 1:217\u2013222, 1954.","journal-title":"Nav. Res. Logistics Q."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling. Elsevier, 1995.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"T. Erlebach, M. Gantenbein, D. H\u00fcrlimann, G. Neyer, A. Pagourtzis, P. Penna, K. Schlude, K. Steinh\u00f6fel, D.S. Taylor, and P. Widmayer. On the complexity of train assignment problems. Technical report, Swiss Federal Institute of Technology Z\u00fcrich (ETH), 2001. Available at http:\/\/www.inf.ethz.ch\/ .","DOI":"10.1007\/3-540-45678-3_34"},{"key":"34_CR10","unstructured":"R. Freling, J.M.P. Paix\u00e3o, and A.P.M. Wagelmans. Models and algorithms for vehicle scheduling. Report 9562\/A, Econometric Institute, Erasmus University Rotterdam, 1999."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"A. L\u00f6bel. Optimal vehicle scheduling in public transit. PhD thesis, TU Berlin, 1998.","DOI":"10.1287\/mnsc.44.12.1637"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"C. Papadimitriou and M. Yannakakis. Optimization, approximization and complexity classes. Journal of Computer and System Sciences, 43:425\u2013440, 1991.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1287\/opre.42.1.41","volume":"42","author":"C. Ribeiro","year":"1994","unstructured":"C. Ribeiro and F. Soumis. A column generation approach to the multiple-depot vehicle scheduling problem. Operations Research, 42(1):41\u201352, 1994.","journal-title":"Operations Research"},{"issue":"3","key":"34_CR14","first-page":"205","volume":"6","author":"A. Schrijver","year":"1993","unstructured":"A. Schrijver. Minimum circulation of railway stock. CWI Quarterly, 6(3):205\u2013217, 1993.","journal-title":"CWI Quarterly"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T15:03:52Z","timestamp":1684076632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}