{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T04:05:02Z","timestamp":1768017902566,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671135"],"award-info":[{"award-number":["11671135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["19ZR1411800"],"award-info":[{"award-number":["19ZR1411800"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11590-021-01774-5","type":"journal-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T15:02:58Z","timestamp":1625065378000},"page":"1215-1234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximation algorithms for the k-depots Hamiltonian path problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Yichen","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1215-7622","authenticated-orcid":false,"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"1","key":"1774_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11590-010-0252-4","volume":"6","author":"J Bae","year":"2012","unstructured":"Bae, J., Rathinam, S.: Approximation algorithms for multiple terminal, hamiltonian path problems. Optim. Lett. 6(1), 69\u201385 (2012)","journal-title":"Optim. Lett."},{"key":"1774_CR2","volume-title":"Combinatorial Optimization","author":"WJ Cook","year":"2011","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (2011)"},{"key":"1774_CR3","doi-asserted-by":"crossref","unstructured":"Giannakos, A., Hifi, M., Kheffache, R., Ouafi, R.: An approximation algorithm for the three depots hamiltonian path problem. In: Optimization Theory, Decision Making, and Operations Research Applications, Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research, pp. 351\u2013359. Springer (2013)","DOI":"10.1007\/978-1-4614-5134-1_25"},{"key":"1774_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cie.2017.06.022","volume":"111","author":"A Giannakos","year":"2017","unstructured":"Giannakos, A., Hifi, M., Kheffache, R., Ouafi, R.: An approximation algorithm for the k-fixed depots problem. Comput. Indus. Eng. 111, 50\u201355 (2017)","journal-title":"Comput. Indus. Eng."},{"issue":"5","key":"1774_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"JA Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of christofides\u2019 heuristic: some paths are more difficult than cycles. Op. Res. Lett. 10(5), 291\u2013295 (1991)","journal-title":"Op. Res. Lett."},{"key":"1774_CR6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2007","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2007)"},{"issue":"6","key":"1774_CR7","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.orl.2007.02.001","volume":"35","author":"W Malik","year":"2007","unstructured":"Malik, W., Rathinam, S., Darbha, S.: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Op. Res. Lett. 35(6), 747\u2013753 (2007)","journal-title":"Op. Res. Lett."},{"issue":"1","key":"1774_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.orl.2009.10.001","volume":"38","author":"S Rathinam","year":"2010","unstructured":"Rathinam, S., Sengupta, R.: 3\/2-approximation algorithm for two variants of a 2-depot hamiltonian path problem. Op. Res. Lett. 38(1), 63\u201368 (2010)","journal-title":"Op. Res. Lett."},{"issue":"1","key":"1774_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TASE.2006.872110","volume":"4","author":"S Rathinam","year":"2007","unstructured":"Rathinam, S., Sengupta, R., Darbha, S.: A resource allocation algorithm for multivehicle systems with nonholonomic constraints. IEEE Trans. Autom. Sci. Eng. 4(1), 98\u2013104 (2007)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"1774_CR10","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1287\/ijoc.2015.0650","volume":"27","author":"Z Xu","year":"2015","unstructured":"Xu, Z., Rodrigues, B.: A 3\/2-approximation algorithm for the multiple tsp with a fixed number of depots. INFORMS J. Comput. 27(4), 636\u2013645 (2015)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1774_CR11","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.ejor.2016.08.054","volume":"257","author":"Z Xu","year":"2017","unstructured":"Xu, Z., Rodrigues, B.: An extension of the christofides heuristic for the generalized multiple depot multiple traveling salesmen problem. Euro. J. Op. Res. 257(3), 735\u2013745 (2017)","journal-title":"Euro. J. Op. Res."},{"issue":"3","key":"1774_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.orl.2011.03.002","volume":"39","author":"Z Xu","year":"2011","unstructured":"Xu, Z., Xu, L., Rodrigues, B.: An analysis of the extended christofides heuristic for the k-depot tsp. Op. Res. Lett. 39(3), 218\u2013223 (2011)","journal-title":"Op. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01774-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01774-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01774-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T12:44:05Z","timestamp":1650113045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01774-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,30]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1774"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01774-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,30]]},"assertion":[{"value":"19 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}