{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T06:01:10Z","timestamp":1780639270871,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,9]],"date-time":"2010-05-09T00:00:00Z","timestamp":1273363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0361-y","type":"journal-article","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T07:40:51Z","timestamp":1273304451000},"page":"207-231","source":"Crossref","is-referenced-by-count":90,"title":["Solving a real-world train-unit assignment problem"],"prefix":"10.1007","volume":"124","author":[{"given":"Valentina","family":"Cacchiani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Caprara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,9]]},"reference":[{"key":"361_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/trsc.1030.0044","volume":"38","author":"E.W.J. Abbink","year":"2004","unstructured":"Abbink E.W.J., van den Berg B.W.V., Kroon L.G., Salomon M.: Allocation of railway rolling stock for passenger trains. Transp. Sci. 38, 33\u201341 (2004)","journal-title":"Transp. Sci."},{"key":"361_CR2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/trsc.1060.0155","volume":"40","author":"A. Alfieri","year":"2006","unstructured":"Alfieri A., Groot R., Kroon L.G., Schrijver A.: Efficient circulation of railway rolling stock. Transp. Sci. 40, 378\u2013391 (2006)","journal-title":"Transp. Sci."},{"key":"361_CR3","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/inte.28.1.6","volume":"28","author":"N. Ben-Khedher","year":"1998","unstructured":"Ben-Khedher N., Kintanar J., Queille C., Stripling W.: Schedule optimization at SNCF: from conception to day of departure. Interfaces 28, 6\u201323 (1998)","journal-title":"Interfaces"},{"key":"361_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.endm.2006.06.064","volume":"25","author":"F. Bonomo","year":"2006","unstructured":"Bonomo F., Dur\u00e1n G., Marenco J.: Exploring the complexity boundary between coloring and list-coloring. Electron. Notes Discret. Math. 25, 41\u201347 (2006)","journal-title":"Electron. Notes Discret. Math."},{"key":"361_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1024843208074","volume":"27","author":"J. Brucker","year":"2003","unstructured":"Brucker J., Hurink J.L., Rolfes T.: Routing of railway carriages. J. Glob. Optim. 27, 313\u2013332 (2003)","journal-title":"J. Glob. Optim."},{"key":"361_CR6","first-page":"415","volume":"79","author":"M.R. Bussieck","year":"1997","unstructured":"Bussieck M.R., Winter T., Zimmermann U.T.: Discrete optimization in public rail transport. Math. Program. 79, 415\u2013444 (1997)","journal-title":"Math. Program."},{"key":"361_CR7","unstructured":"Cacchiani, V., Caprara, A., Mar\u00f3ti, G., Toth, P.: On Integer Polytopes with Few Nonzero Vertices, Research Report OR\/09\/1 DEIS. http:\/\/www.or.deis.unibo.it\/alberto\/smallsupp.pdf (2009)"},{"key":"361_CR8","volume-title":"Handbooks in OR & MS, vol. 14","author":"A. Caprara","year":"2006","unstructured":"Caprara A., Kroon L., Monaci M., Peeters M., Toth P.: Passenger Railway Optimization. In: Barnhart, C., Laporte, G. (eds) Handbooks in OR & MS, vol. 14, Elsevier, Amsterdam (2006)"},{"key":"361_CR9","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"D. Carpaneto","year":"1989","unstructured":"Carpaneto D., Dell\u2019Amico M., Fischetti M., Toth P.: A branch and bound algorithm for the multiple-depot vehicle scheduling problem. Networks 19, 531\u2013548 (1989)","journal-title":"Networks"},{"key":"361_CR10","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A.: Combinatorial Optimization. Wiley, New York (1998)"},{"key":"361_CR11","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/trsc.32.4.380","volume":"32","author":"J.-F. Cordeau","year":"1998","unstructured":"Cordeau J.-F., Toth P., Vigo D.: A survey of optimization models for train routing and scheduling. Transp. Sci. 32, 380\u2013404 (1998)","journal-title":"Transp. Sci."},{"key":"361_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/trsc.34.2.133.12308","volume":"34","author":"J.-F. Cordeau","year":"2000","unstructured":"Cordeau J.-F., Soumis F., Desrosiers J.: A Benders decomposition approach for the locomotive and car assignment problem. Transp. Sci. 34, 133\u2013149 (2000)","journal-title":"Transp. Sci."},{"key":"361_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.49.4.531.11226","volume":"49","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau J.-F., Soumis F., Desrosiers J.: Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49, 531\u2013548 (2001)","journal-title":"Oper. Res."},{"key":"361_CR14","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/S0191-2615(00)00022-9","volume":"35","author":"J.-F. Cordeau","year":"2002","unstructured":"Cordeau J.-F., Desaulniers G., Lingaya N., Soumis F., Desrosiers J.: Simultaneous locomotive and car assignment at VIA rail Canada. Transp. Res. 35, 767\u2013787 (2002)","journal-title":"Transp. Res."},{"key":"361_CR15","first-page":"35","volume-title":"Handbooks in OR & MS, vol. 8","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers J., Dumas Y., Solomon M.M., Soumis F. et\u00a0al.: Time Constrained Routing and Scheduling. In: Ball, M.O. (eds) Handbooks in OR & MS, vol. 8, pp. 35\u2013139. Elsevier, Amsterdam (1995)"},{"key":"361_CR16","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.ejor.2005.03.032","volume":"174","author":"P.-J. Fioole","year":"2006","unstructured":"Fioole P.-J., Kroon L.G., Mar\u00f3ti G., Schrijver A.: A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. 174, 1281\u20131297 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"361_CR17","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"361_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"361_CR19","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1050.0240","volume":"54","author":"A. Hadjar","year":"2006","unstructured":"Hadjar A., Marcotte O., Soumis F.: A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. 54, 130\u2013149 (2006)","journal-title":"Oper. Res."},{"key":"361_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1111\/j.1467-9574.2005.00303.x","volume":"59","author":"D. Huisman","year":"2005","unstructured":"Huisman D., Kroon L.G., Lentink R.M., Vromans M.J.C.M.: Operations research in passenger railway transportation. Stat. Neerland. 59, 467\u2013497 (2005)","journal-title":"Stat. Neerland."},{"key":"361_CR21","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/S0191-2615(01)00027-3","volume":"36","author":"N. Lingaya","year":"2002","unstructured":"Lingaya N., Cordeau J.-F., Desaulniers G., Desrosiers J., Soumis F.: Operational Car Assignment at VIA Rail Canada. Transp. Res. 36, 755\u2013778 (2002)","journal-title":"Transp. Res."},{"key":"361_CR22","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"361_CR23","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/j.cor.2006.03.019","volume":"35","author":"M. Peeters","year":"2008","unstructured":"Peeters M., Kroon L.G.: Circulation of railway rolling stock: a branch-and-price approach. Comput. Oper. Res. 35, 538\u2013556 (2008)","journal-title":"Comput. Oper. Res."},{"key":"361_CR24","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.trb.2005.05.005","volume":"40","author":"S. Rouillon","year":"2006","unstructured":"Rouillon S., Desaulniers G., Soumis F.: An extended branch-and-bound method for locomotive assignment. Transp. Res. 40, 404\u2013423 (2006)","journal-title":"Transp. Res."},{"key":"361_CR25","first-page":"205","volume":"6","author":"A. Schrijver","year":"1993","unstructured":"Schrijver A.: Minimum circulation of railway stock. CWI Q. 6, 205\u2013217 (1993)","journal-title":"CWI Q."},{"key":"361_CR26","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1287\/mnsc.45.8.1156","volume":"45","author":"K. Ziarati","year":"1999","unstructured":"Ziarati K., Soumis F., Desrosiers J., Solomon M.M.: A branch-first, cut-second approach for locomotive assignment. Manag. Sci. 45, 1156\u20131168 (1999)","journal-title":"Manag. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0361-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0361-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0361-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0361-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,9]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["361"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0361-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,9]]}}}