{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:20:29Z","timestamp":1762521629144},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,10,2]],"date-time":"2013-10-02T00:00:00Z","timestamp":1380672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10951-013-0348-7","type":"journal-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T08:33:39Z","timestamp":1380616419000},"page":"587-599","source":"Crossref","is-referenced-by-count":7,"title":["A reduction approach to the two-campus transport problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Hagai","family":"Ilani","sequence":"first","affiliation":[]},{"given":"Elad","family":"Shufan","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Grinshpoun","sequence":"additional","affiliation":[]},{"given":"Aviad","family":"Belulu","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Fainberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,2]]},"reference":[{"key":"348_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"RE Bellman","year":"1958","unstructured":"Bellman, R. E. (1958). On a routing problem. Quarterly of Applied Mathematics, 16, 87\u201390.","journal-title":"Quarterly of Applied Mathematics"},{"key":"348_CR2","first-page":"104","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows. Parts I and II Transportation Science, 39, 104\u2013139.","journal-title":"Parts I and II Transportation Science"},{"key":"348_CR3","volume-title":"Logistics engineering handbook","author":"K B\u00fclb\u00fcl","year":"2008","unstructured":"B\u00fclb\u00fcl, K., Ulusoy, G., & Sen, A. (2008). Classic transportation problems. In D. G. Taylor (Ed.), Logistics engineering handbook. Boca Raton: CRC Press."},{"key":"348_CR4","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.30.5.1018","volume":"30","author":"AK Chakravarty","year":"1982","unstructured":"Chakravarty, A. K., Orlin, J. B., & Rothblum, U. G. (1982). A partitioning problem with additive objective with an application to optimal inventory grouping for joint replenishment. Operating Research, 30, 1018\u20131022.","journal-title":"Operating Research"},{"issue":"1","key":"348_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10878-010-9341-7","volume":"23","author":"H Chang","year":"2012","unstructured":"Chang, H., Hwang, F. K., & Rothblum, U. G. (2012). A new approach to solve open-partition problems. Journal of Combinatorial Optimization, 23(1), 61\u201378.","journal-title":"Journal of Combinatorial Optimization"},{"key":"348_CR6","first-page":"129","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996). Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 73, 129\u2013174.","journal-title":"Mathematical Programming"},{"key":"348_CR7","doi-asserted-by":"crossref","first-page":"2946","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J. F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153, 2946.","journal-title":"Annals of Operations Research"},{"key":"348_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerische Mathematik, 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"348_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: Latest advances and new challenges","author":"B Golden","year":"2008","unstructured":"Golden, B., Raghavan, S., & Wasil, E. (2008). The vehicle routing problem: Latest advances and new challenges. Boston: Springer."},{"issue":"2","key":"348_CR10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1030.0052","volume":"16","author":"WE Paepe de","year":"2004","unstructured":"de Paepe, W. E., Lenstra, J. K., Sgall, J., Sitters, R. A., & Stougie, L. (2004). Computer-aided complexity classification of dial-a-ride problems. Informs Journal on Computing, 16(2), 120\u2013132.","journal-title":"Informs Journal on Computing"},{"key":"348_CR11","doi-asserted-by":"crossref","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Part I Journal f\u00fcr Betriebswirtschaft, 58(1), 21\u201351.","DOI":"10.1007\/s11301-008-0033-7"},{"key":"348_CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58(2)","author":"SN Parragh","year":"2008","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Part II Journal f\u00fcr Betriebswirtschaft, 58(2), 81\u2013117.","journal-title":"Part II Journal f\u00fcr Betriebswirtschaft"},{"key":"348_CR13","unstructured":"Musatova, E., & Lazarev, A. (2012). Algorithm for solving two-stations railway scheduling problem, 25th European Conference on Operational Research."},{"key":"348_CR14","unstructured":"Shufan, E., Ilani, H. & Grinshpoun, T. (2011). A Two-Campus Transport Problem. Proceedings of the 5th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2011), (pp. 173\u2013184)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0348-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0348-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0348-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,27]],"date-time":"2019-07-27T17:34:22Z","timestamp":1564248862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0348-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,2]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["348"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0348-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,2]]}}}