{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T06:42:16Z","timestamp":1781160136929,"version":"3.54.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T00:00:00Z","timestamp":1348704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0553-x","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T15:24:50Z","timestamp":1348673090000},"page":"1517-1524","source":"Crossref","is-referenced-by-count":29,"title":["The hierarchical traveling salesman problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Kiran","family":"Panchamgam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yupei","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruce","family":"Golden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Dussault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward","family":"Wasil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,27]]},"reference":[{"issue":"2","key":"553_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1080\/15472450802023329","volume":"12","author":"B Balcik","year":"2008","unstructured":"Balcik, B., Beamon, B.M., Smilowitz, K.: Last mile distribution in Humanitarian Relief. J. Intell. Transport. Syst. 12(2), 51\u201363 (2008)","journal-title":"J. Intell. Transport. Syst."},{"issue":"2","key":"553_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transport. Sci. 42(2), 127\u2013145 (2008)","journal-title":"Transport. Sci."},{"key":"553_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the Travelling Salesman Problem. Graduate School of Industrial Administration, CMU. Report 388 (1976)"},{"issue":"3","key":"553_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/inte.22.3.100","volume":"22","author":"MT Fiala Timlin","year":"1992","unstructured":"Fiala Timlin, M.T., Pulleyblank, W.R.: Precedence constrained routing and helicopter scheduling: Heuristic design. Interfaces 22(3), 100\u2013111 (1992)","journal-title":"Interfaces"},{"issue":"4","key":"553_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s004530010045","volume":"28","author":"N Guttman-Beck","year":"2000","unstructured":"Guttman-Beck, N., Hassin, R., Khuller, S., Raghavachari, B.: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica 28(4), 422\u2013437 (2000)","journal-title":"Algorithmica"},{"key":"553_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ejor.2004.06.003","volume":"169","author":"P Korteweg","year":"2006","unstructured":"Korteweg, P., Volgenant, T.: On the hierarchical Chinese postman problem with linear ordered classes. Eur. J. Oper. Res. 169, 41\u201352 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"553_CR7","unstructured":"Mennell, W.K.: Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem. Ph.D. thesis, University of Maryland, College Park (2009)"},{"issue":"11","key":"553_CR8","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Carlo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comp. Oper. Res. 37(11), 1877\u20131885 (2010)","journal-title":"Comp. Oper. Res."},{"key":"553_CR9","unstructured":"Panchamgam, K.V.: Essays in Retail Operations and Humanitarian Logistics. Ph.D. thesis, University of Maryland, College Park (2011)"},{"issue":"2","key":"553_CR10","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transport. Sci. 14(2), 130\u2013154 (1980)","journal-title":"Transport. Sci."},{"issue":"1","key":"553_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11590-010-0256-0","volume":"6","author":"S Yadlapalli","year":"2012","unstructured":"Yadlapalli, S., Rathinam, S., Darbha, S.: 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim. Lett. 6(1), 141\u2013152 (2012)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0553-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0553-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0553-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:33Z","timestamp":1559409093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0553-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,27]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["553"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0553-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,27]]}}}