{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T23:48:47Z","timestamp":1776728927723,"version":"3.51.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T00:00:00Z","timestamp":1455235200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M007243\/1"],"award-info":[{"award-number":["EP\/M007243\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10589-016-9831-3","type":"journal-article","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T09:41:33Z","timestamp":1455270093000},"page":"881-919","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Local convex hulls for a special class of integer multicommodity flow problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Zhiyuan","family":"Lin","sequence":"first","affiliation":[]},{"given":"Raymond S. K.","family":"Kwan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,12]]},"reference":[{"key":"9831_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewoods Cliffs, USA (1993)"},{"issue":"3","key":"9831_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(3), 378\u2013391 (2006)","journal-title":"Transp. Sci."},{"issue":"4","key":"9831_CR3","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469\u2013483 (1996)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"9831_CR4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/trsc.5.1.36","volume":"5","author":"M Bellmore","year":"1971","unstructured":"Bellmore, M., Bennington, G., Lubore, S.: A multivehicle tanker scheduling problem. Transp. Sci. 5(1), 36\u201347 (1971)","journal-title":"Transp. Sci."},{"issue":"1","key":"9831_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10288-008-0075-7","volume":"7","author":"V Cacchiani","year":"2009","unstructured":"Cacchiani, V.: Models and algorithms for combinatorial optimization problems arising in railway applications. Q. J. Oper. Res. 7(1), 109\u2013112 (2009)","journal-title":"Q. J. Oper. Res."},{"issue":"1\u20132","key":"9831_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-010-0361-y","volume":"124","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Solving a real-world train-unit assignment problem. Math. Progr. B 124(1\u20132), 207\u2013231 (2010)","journal-title":"Math. Progr. B"},{"key":"9831_CR7","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Models and algorithms for the train unit assignment problem. In: Combinatorial Optimization, Lecture Notes in Computer Science, vol. 7422, pp. 24\u201335. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-32147-4_4"},{"issue":"12","key":"9831_CR8","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1016\/j.dam.2011.10.035","volume":"161","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: A Lagrangian heuristic for a train-unit assignment problem. Discret. Appl. Math. 161(12), 1707\u20131718 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"9831_CR9","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/S0191-2615(00)00022-9","volume":"35","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Desaulniers, G., Lingaya, N., Soumis, F., Desrosiers, J.: Simultaneous locomotive and car assignment at via rail canada. Transp. Res. Part B Methodol. 35(8), 767\u2013787 (2001)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"9831_CR10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.orl.2012.11.007","volume":"41","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani, V., Caprara, A., Mar\u00f3ti, G., Toth, P.: On integer polytopes with few nonzero vertices. Oper. Res. Lett. 41(1), 74\u201377 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"9831_CR11","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.49.4.531.11226","volume":"49","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Soumis, F., Desrosiers, J.: Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49(4), 531\u2013548 (2001)","journal-title":"Oper. Res."},{"issue":"2","key":"9831_CR12","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.ejor.2005.03.032","volume":"174","author":"PJ Fioole","year":"2006","unstructured":"Fioole, P.J., Kroon, L., Mar\u00f3ti, G., Schrijver, A.: A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. 174(2), 1281\u20131297 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9831_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Measures of symmetry for convex sets. In: Convexity: Proceedings of the Seventh Symposium in Pure Mathematics of the American Mathematical Society, vol. 7, p. 233. American Mathematical Society (1963)","DOI":"10.1090\/pspum\/007\/0156259"},{"key":"9831_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.endm.2013.05.089","volume":"41","author":"Z Lin","year":"2013","unstructured":"Lin, Z., Kwan, R.S.K.: An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling. Electron. Notes Discret. Math. 41, 165\u2013172 (2013)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"9831_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s12469-013-0073-9","volume":"6","author":"Z Lin","year":"2014","unstructured":"Lin, Z., Kwan, R.S.K.: A two-phase approach for real-world train unit scheduling. Public Transp. 6(1), 35\u201365 (2014)","journal-title":"Public Transp."},{"issue":"9","key":"9831_CR16","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. Part B Methodol. 36(9), 755\u2013778 (2002)","journal-title":"Transp. Res. Part B Methodol."},{"key":"9831_CR17","first-page":"261","volume-title":"Concepts of Combinatorial Optimization","author":"AR Mahjoub","year":"2010","unstructured":"Mahjoub, A.R.: Polyhedral approaches, chap. 10. In: Paschos, V.T. (ed.) Concepts of Combinatorial Optimization, pp. 261\u2013320. Wiley, Hoboken, USA (2010)"},{"key":"9831_CR18","unstructured":"Mar\u00f3ti, G.: Operations research models for railway rolling stock planning. Ph.D. thesis, Eindhoven University of Technology, The Netherlands (2006)"},{"issue":"02","key":"9831_CR19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17(02), 179\u2013184 (1970)","journal-title":"Mathematika"},{"key":"9831_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"2","key":"9831_CR21","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(2), 538\u2013556 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9831_CR22","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. Part B Methodol. 40(5), 404\u2013423 (2006)","journal-title":"Transp. Res. Part B Methodol."},{"key":"9831_CR23","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":"9831_CR24","unstructured":"The Geometry Center of the University of Minnesota: The QuickHull\u2019s official website. http:\/\/www.qhull.org\/"},{"key":"9831_CR25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.2140\/pjm.1973.46.303","volume":"46","author":"G Varsi","year":"1973","unstructured":"Varsi, G.: The multidimensional content of the frustrum of the simplex. Pac. J. Math. 46, 303\u2013314 (1973)","journal-title":"Pac. J. Math."},{"key":"9831_CR26","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198531470.001.0001","volume-title":"Convexity","author":"R Webster","year":"1994","unstructured":"Webster, R.: Convexity. Oxford University Press, New York (1994)"},{"key":"9831_CR27","unstructured":"Wolfenden, K., Wren, A.: Locomotive scheduling by computer. In: Proc. British Joint Computer Conference, vol. 1, pp. 31\u201337. IEEE Conference Publication No. 19, London, UK (1966)"},{"key":"9831_CR28","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998)"},{"key":"9831_CR29","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":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9831-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9831-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9831-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T09:35:56Z","timestamp":1718357756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9831-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,12]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9831"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9831-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,12]]}}}