{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:34:16Z","timestamp":1742949256233,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030499877"},{"type":"electronic","value":"9783030499884"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49988-4_4","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"49-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Extension of the Das and Mathieu QPTAS to the Case of Polylog Capacity Constrained CVRP in Metric Spaces of a Fixed Doubling Dimension"],"prefix":"10.1007","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":[[2020,6,29]]},"reference":[{"issue":"6","key":"4_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). \nhttps:\/\/doi.org\/10.1016\/j.aim.2011.08.003","journal-title":"Adv. Math."},{"issue":"6","key":"4_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). \nhttps:\/\/doi.org\/10.1142\/S0129054110007623","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR3","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":"4_CR4","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). \nhttps:\/\/doi.org\/10.1145\/273865.273901","journal-title":"J. ACM"},{"key":"4_CR5","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 1997, pp. 275\u2013283. ACM, New York (1997). \nhttps:\/\/doi.org\/10.1145\/258533.258602","DOI":"10.1145\/258533.258602"},{"key":"4_CR6","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). \nhttps:\/\/doi.org\/10.15514\/ISPRAS-2019-31(4)-8","journal-title":"Proc. Inst. Syst. Program. RAS"},{"issue":"4","key":"4_CR7","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). \nhttps:\/\/doi.org\/10.1137\/130913328","journal-title":"SIAM J. Comput."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","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.) WADS 2019. LNCS, vol. 11646, pp. 99\u2013111. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-24766-9_8"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Chen, J., Gui, P., Ding, T., Zhou, Y.: Optimization of transportation routing problem for fresh food by improved ant colony algorithm based on Tabu search. Sustainability 11 (2019). \nhttps:\/\/doi.org\/10.3390\/su11236584","DOI":"10.3390\/su11236584"},{"issue":"1","key":"4_CR10","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. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-014-9906-4","volume":"73","author":"A Das","year":"2014","unstructured":"Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73(1), 115\u2013142 (2014). \nhttps:\/\/doi.org\/10.1007\/s00453-014-9906-4","journal-title":"Algorithmica"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-14493-7_7","volume-title":"Contemporary Operations and Logistics","author":"E Demir","year":"2019","unstructured":"Demir, E., Huckle, K., Syntetos, A., Lahy, A., Wilson, M.: Vehicle routing problem: past and future. In: Wells, P. (ed.) Contemporary Operations and Logistics, pp. 97\u2013117. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-14493-7_7"},{"issue":"1","key":"4_CR13","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). \nhttps:\/\/doi.org\/10.1111\/itor.12604","journal-title":"Int. Trans. Oper. Res."},{"key":"4_CR14","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). \nhttps:\/\/doi.org\/10.1109\/SFCS.2003.1238226","DOI":"10.1109\/SFCS.2003.1238226"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985). \nhttps:\/\/doi.org\/10.1287\/moor.10.4.527","journal-title":"Math. Oper. Res."},{"key":"4_CR16","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). \nhttps:\/\/doi.org\/10.1016\/j.eswa.2015.10.013","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"4_CR17","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). \nhttps:\/\/doi.org\/10.1134\/S0081543817050133","journal-title":"Proc. Steklov Inst. Math."},{"key":"4_CR18","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.21538\/0134-4889-2019-25-4-235-248","DOI":"10.21538\/0134-4889-2019-25-4-235-248"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1134\/S0081543819070058","volume":"307","author":"MY Khachai","year":"2019","unstructured":"Khachai, M.Y., Ogorodnikov, Y.Y.: Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows. Proc. Steklov Inst. Math. 307(1), 51\u201363 (2019). \nhttps:\/\/doi.org\/10.1134\/S0081543819070058","journal-title":"Proc. Steklov Inst. Math."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-030-11027-7_30","volume-title":"Analysis of Images, Social Networks and Texts","author":"M Khachay","year":"2018","unstructured":"Khachay, M., Ogorodnikov, Y.: Efficient PTAS for the Euclidean CVRP with time windows. In: van der Aalst, W.M.P., et al. (eds.) AIST 2018. LNCS, vol. 11179, pp. 318\u2013328. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-11027-7_30"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-22629-9_22","volume-title":"Mathematical Optimization Theory and Operations Research","author":"M Khachay","year":"2019","unstructured":"Khachay, M., Ogorodnikov, Y.: Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 309\u2013327. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-22629-9_22"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-44914-2_16","volume-title":"Discrete Optimization and Operations Research","author":"M Khachay","year":"2016","unstructured":"Khachay, M., Dubinin, R.: PTAS for the Euclidean capacitated vehicle routing problem in $$R^d$$. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 193\u2013205. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_16"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-26626-8_14","volume-title":"Combinatorial Optimization and Applications","author":"M Khachay","year":"2015","unstructured":"Khachay, M., Zaytseva, H.: Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 178\u2013190. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26626-8_14"},{"key":"4_CR24","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 2018, pp. 9861\u20139871. Curran Associates Inc., Red Hook (2018)"},{"key":"4_CR25","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). \nhttps:\/\/doi.org\/10.1109\/CEC.2017.7969606","DOI":"10.1109\/CEC.2017.7969606"},{"key":"4_CR26","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":"4_CR27","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). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2018.04.009","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR28","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). \nhttps:\/\/doi.org\/10.1016\/j.cor.2018.07.021","journal-title":"Comput. Oper. Res."},{"key":"4_CR29","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 2004, pp. 281\u2013290. Association for Computing Machinery, New York (2004). \nhttps:\/\/doi.org\/10.1145\/1007352.1007399","DOI":"10.1145\/1007352.1007399"},{"key":"4_CR30","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, Philadelphia (2014)","edition":"2"},{"issue":"1","key":"4_CR31","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). \nhttps:\/\/doi.org\/10.1016\/j.cor.2012.07.018","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49988-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:03:06Z","timestamp":1593385386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.nsc.ru\/conference\/motor\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}