{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:02Z","timestamp":1775054522950,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:00:00Z","timestamp":1611878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:00:00Z","timestamp":1611878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Russian Foundation for Basic Research","award":["19-07-01243"],"award-info":[{"award-number":["19-07-01243"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10898-020-00990-0","type":"journal-article","created":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T09:42:56Z","timestamp":1611913376000},"page":"679-710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient approximation of the metric CVRP in spaces of fixed doubling dimension"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-4128","authenticated-orcid":false,"given":"Daniel","family":"Khachay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,29]]},"reference":[{"issue":"6","key":"990_CR1","doi-asserted-by":"publisher","first-page":"3026","DOI":"10.1016\/j.aim.2011.08.003","volume":"228","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Advances in metric embedding theory. Adv. Math. 228(6), 3026\u20133126 (2011). https:\/\/doi.org\/10.1016\/j.aim.2011.08.003","journal-title":"Adv. Math."},{"issue":"6","key":"990_CR2","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1142\/S0129054110007623","volume":"21","author":"A Adamaszek","year":"2010","unstructured":"Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane rof moderately large values of $$k$$. Int. J. Found. Comput. Sci. 21(6), 893\u2013904 (2010). https:\/\/doi.org\/10.1142\/S0129054110007623","journal-title":"Int. J. Found. Comput. Sci."},{"key":"990_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.01.002","volume":"105","author":"F Arnold","year":"2019","unstructured":"Arnold, F., S\u00f6rensen, K.: Knowledge-guided local search for the vehicle routing problem. Comput. Oper. Res. 105, 32\u201346 (2019). https:\/\/doi.org\/10.1016\/j.cor.2019.01.002","journal-title":"Comput. Oper. Res."},{"key":"990_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling Salesman and other geometric problems. J. ACM 45, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"990_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45, 70\u2013122 (1998). https:\/\/doi.org\/10.1145\/273865.273901","journal-title":"J. ACM"},{"key":"990_CR6","doi-asserted-by":"publisher","unstructured":"Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC \u201997, pp. 275\u2013283. ACM, New York(1997). https:\/\/doi.org\/10.1145\/258533.258602","DOI":"10.1145\/258533.258602"},{"key":"990_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.15514\/ISPRAS-2019-31(4)-8","volume":"31","author":"S Avdoshin","year":"2019","unstructured":"Avdoshin, S., Beresneva, E.: Local search metaheuristics for capacitated vehicle routing problem: a comparative study. Proc. Inst. Syst. Program. RAS 31, 121\u2013138 (2019). https:\/\/doi.org\/10.15514\/ISPRAS-2019-31(4)-8","journal-title":"Proc. Inst. Syst. Program. RAS"},{"issue":"4","key":"990_CR8","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1137\/130913328","volume":"45","author":"Y Bartal","year":"2016","unstructured":"Bartal, Y., Gottlieb, L.A., Krauthgamer, R.: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. SIAM J. Comput. 45(4), 1563\u20131581 (2016). https:\/\/doi.org\/10.1137\/130913328","journal-title":"SIAM J. Comput."},{"key":"990_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-24766-9_8","volume-title":"Algorithms and Data Structures","author":"A Becker","year":"2019","unstructured":"Becker, A., Klein, P.N., Schild, A.: A PTAS for bounded-capacity vehicle routing in planar graphs. In: Friggstad, Z., Sack, J.R., Salavatipour, M.R. (eds.) Algorithms and Data Structures, pp. 99\u2013111. Springer, Cham, Berlin (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_8"},{"key":"990_CR10","doi-asserted-by":"publisher","DOI":"10.3390\/su11236584","author":"G Chen","year":"2019","unstructured":"Chen, G., Ding, Z.: Optimization of transportation routing problem for fresh food by improved ant colony algorithm based on tabu search. Sustainability (2019). https:\/\/doi.org\/10.3390\/su11236584","journal-title":"Sustainability"},{"issue":"1","key":"990_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"990_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-014-9906-4","volume":"73","author":"A Das","year":"2015","unstructured":"Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73, 115\u2013142 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9906-4","journal-title":"Algorithmica"},{"key":"990_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-14493-7_7","volume-title":"Vehicle Routing Problem: Past and Future","author":"E Demir","year":"2019","unstructured":"Demir, E., Huckle, K., Syntetos, A., Lahy, A., Wilson, M.: Vehicle Routing Problem: Past and Future, pp. 97\u2013117. Springer, Berlin (2019). https:\/\/doi.org\/10.1007\/978-3-030-14493-7_7"},{"issue":"1","key":"990_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1111\/itor.12604","volume":"27","author":"S Frifita","year":"2020","unstructured":"Frifita, S., Masmoudi, M.: VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties. Int Trans Oper Res 27(1), 291\u2013313 (2020). https:\/\/doi.org\/10.1111\/itor.12604","journal-title":"Int Trans Oper Res"},{"key":"990_CR15","doi-asserted-by":"publisher","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, pp. 534\u2013543 (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238226","DOI":"10.1109\/SFCS.2003.1238226"},{"issue":"4","key":"990_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985). https:\/\/doi.org\/10.1287\/moor.10.4.527","journal-title":"Math. Oper. Res."},{"key":"990_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2015.10.013","volume":"47","author":"P Hokama","year":"2016","unstructured":"Hokama, P., Miyazawa, F.K., Xavier, E.C.: A branch-and-cut approach for the vehicle routing problem with loading constraints. Expert Syst. Appl. 47, 1\u201313 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2015.10.013","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"990_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.21538\/0134-4889-2019-25-4-235-248","volume":"25","author":"M Khachai","year":"2019","unstructured":"Khachai, M., Ogorodnikov, Y.: Haimovich\u2013Rinnooy kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension. Trudy instituta matematiki i mekhaniki UrO RAN 25(4), 235\u2013248 (2019). https:\/\/doi.org\/10.21538\/0134-4889-2019-25-4-235-248","journal-title":"Trudy instituta matematiki i mekhaniki UrO RAN"},{"issue":"suppl. 1","key":"990_CR19","doi-asserted-by":"publisher","first-page":"S51","DOI":"10.1134\/S0081543819070058","volume":"307","author":"M Khachai","year":"2019","unstructured":"Khachai, M., Ogorodnikov, Y.: Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows. Proc. Steklov Inst. Math. 307(suppl. 1), S51\u2013S63 (2019). https:\/\/doi.org\/10.1134\/S0081543819070058","journal-title":"Proc. Steklov Inst. Math."},{"issue":"1","key":"990_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1134\/S0081543817050133","volume":"297","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Dubinin, R.D.: Approximability of the vehicle routing problem in finite-dimensional euclidean spaces. Proc. Steklov Inst. Math. 297(1), 117\u2013128 (2017). https:\/\/doi.org\/10.1134\/S0081543817050133","journal-title":"Proc. Steklov Inst. Math."},{"key":"990_CR21","doi-asserted-by":"publisher","unstructured":"Khachay, M., Dubinin, R.: PTAS for the Euclidean capacitated vehicle routing problem in $$R^d$$, LNCS, vol. 9869, pp. 193\u2013205. Springer, Cham, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_16","DOI":"10.1007\/978-3-319-44914-2_16"},{"key":"990_CR22","doi-asserted-by":"publisher","unstructured":"Khachay, M., Ogorodnikov, Y.: Efficient PTAS for the Euclidean CVRP with time windows. In: Analysis of Images, Social Networks and Texts\u20147th International Conference, AIST 2018, LNCS, vol. 11179, pp. 318\u2013328. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-11027-7_30","DOI":"10.1007\/978-3-030-11027-7_30"},{"key":"990_CR23","doi-asserted-by":"publisher","unstructured":"Khachay, M., Ogorodnikov, Y.: Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand. In: Mathematical Optimization Theory and Operations Research\u201418th International Conference (MOTOR 2019). Proceedings, LNCS, vol. 11548, pp. 309\u2013327. Springer, Berlin (2019). https:\/\/doi.org\/10.1007\/978-3-030-22629-9_22","DOI":"10.1007\/978-3-030-22629-9_22"},{"key":"990_CR24","doi-asserted-by":"publisher","first-page":"3234","DOI":"10.1134\/S1064562420040080","volume":"102","author":"M Khachay","year":"2020","unstructured":"Khachay, M., Ogorodnikov, Y.: Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension. Dokl. Math. 102, 3234\u2013329 (2020). https:\/\/doi.org\/10.1134\/S1064562420040080","journal-title":"Dokl. Math."},{"key":"990_CR25","doi-asserted-by":"crossref","unstructured":"Khachay, M., Ogorodnikov, Y., Khachay, D.: An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension (accepted). In: Mathematical Optimization Theory and Operations Research\u201419th International Conference (MOTOR 2020). Proceedings, LNCS, vol. 12095. Springer, Berlin (2020)","DOI":"10.1007\/978-3-030-49988-4_4"},{"key":"990_CR26","doi-asserted-by":"publisher","unstructured":"Khachay, M., Zaytseva, H.: Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem, LNCS, vol. 9486, pp. 178\u2013190. Springer, Cham, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_14","DOI":"10.1007\/978-3-319-26626-8_14"},{"key":"990_CR27","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43, 408\u2013416 (2009). https:\/\/doi.org\/10.1287\/trsc.1090.0301","journal-title":"Transp. Sci."},{"issue":"6","key":"990_CR28","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft. Comput. 20(6), 2309\u20132327 (2016). https:\/\/doi.org\/10.1007\/s00500-015-1642-4","journal-title":"Soft. Comput."},{"key":"990_CR29","unstructured":"Nazari, M., Oroojlooy, A., Tak\u00e1\u010d, M., Snyder, L.V.: Reinforcement learning for solving the vehicle routing problem. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS\u201918, pp. 9861\u20139871. Curran Associates Inc., Red Hook (2018)"},{"key":"990_CR30","doi-asserted-by":"publisher","unstructured":"Necula, R., Breaban, M., Raschip, M.: Tackling dynamic vehicle routing problem with time windows by means of ant colony system. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2480\u20132487 (2017). https:\/\/doi.org\/10.1109\/CEC.2017.7969606","DOI":"10.1109\/CEC.2017.7969606"},{"key":"990_CR31","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.: Euclidean TSP is NP-complete. Theoret. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"990_CR32","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2018.04.009","volume":"270","author":"AA Pessoa","year":"2018","unstructured":"Pessoa, A.A., Sadykov, R., Uchoa, E.: Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270(2), 530\u2013543 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2018.04.009","journal-title":"Eur. J. Oper. Res."},{"key":"990_CR33","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cor.2017.03.009","volume":"85","author":"O Polat","year":"2017","unstructured":"Polat, O.: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups. Comput. Oper. Res. 85, 71\u201386 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.03.009","journal-title":"Comput. Oper. Res."},{"key":"990_CR34","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2018.07.021","volume":"100","author":"M Qiu","year":"2018","unstructured":"Qiu, M., Fu, Z., Eglese, R., Tang, Q.: A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups. Comput. Oper. Res. 100, 102\u2013116 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.07.021","journal-title":"Comput. Oper. Res."},{"key":"990_CR35","unstructured":"Smid, M.: On some combinatorial problems in metricspaces of bounded doubling dimension (2010). https:\/\/people.scs.carleton.ca\/ michiel\/mst-ann-doubling.pdf. Accessed Dec 6, 2020"},{"key":"990_CR36","doi-asserted-by":"publisher","first-page":"327","DOI":"10.14257\/ijsip.2016.9.10.31","volume":"9","author":"Y Su-Ping","year":"2016","unstructured":"Su-Ping, Y., Wei-Wei, M.: An improved ant colony optimization for vrp with time windows. Int. J. Signal Process. Image Process. Pattern Recognit. 9, 327\u2013334 (2016). https:\/\/doi.org\/10.14257\/ijsip.2016.9.10.31","journal-title":"Int. J. Signal Process. Image Process. Pattern Recognit."},{"key":"990_CR37","doi-asserted-by":"publisher","unstructured":"Talwar, K.: Bypassing the embedding: Algorithms for low dimensional metrics. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC \u201904, pp. 281\u2013290. Association for Computing Machinery, New York (2004). https:\/\/doi.org\/10.1145\/1007352.1007399","DOI":"10.1145\/1007352.1007399"},{"key":"990_CR38","series-title":"MOS-Siam Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing: Problems, Methods, and Applications","author":"P Toth","year":"2014","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. MOS-Siam Series on Optimization, 2nd edn. SIAM, New Delhi (2014)","edition":"2"},{"issue":"1","key":"990_CR39","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.07.018","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00990-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00990-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00990-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:16:08Z","timestamp":1625638568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00990-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,29]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["990"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00990-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,29]]},"assertion":[{"value":"22 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}