{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T19:02:00Z","timestamp":1789585320279,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T00:00:00Z","timestamp":1790467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,9,28]]},"DOI":"10.1145\/3832810.3832887","type":"proceedings-article","created":{"date-parts":[[2026,9,13]],"date-time":"2026-09-13T00:19:06Z","timestamp":1789258746000},"page":"877-887","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["BP-MDS: Million-Scale Approximate CVRP in Minutes via Parallel Divide-and-Conquer"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1398-7436","authenticated-orcid":false,"given":"Chekkala Sandeep","family":"Reddy","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Madras, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0157-0941","authenticated-orcid":false,"given":"Lakshya Rani","family":"P","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7648-9979","authenticated-orcid":false,"given":"Somesh","family":"Singh","sequence":"additional","affiliation":[{"name":"Siemens EDA, Meylan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4702-4678","authenticated-orcid":false,"given":"Rajesh Pandian","family":"Muniasamy","sequence":"additional","affiliation":[{"name":"Qualcomm, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7490-625X","authenticated-orcid":false,"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,9,27]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Luca Accorsi and Daniele Vigo. 2024. Routing one million customers in a handful of minutes. Computers & Operations Research 164 (apr 2024) 106562. 10.1016\/j.cor.2024.106562","DOI":"10.1016\/j.cor.2024.106562"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Florian Arnold Michel Gendreau and Kenneth S\u00f6rensen. 2019. Efficiently solving very large-scale routing problems. Computers & operations research 107 (2019) 32\u201342.","DOI":"10.1016\/j.cor.2019.03.006"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","unstructured":"Tolga Bektas and Gilbert Laporte. 2011. The Pollution-Routing Problem. Transportation Research Part B: Methodological 45 8 (2011) 1232\u20131250. 10.1016\/j.trb.2011.02.004","DOI":"10.1016\/j.trb.2011.02.004"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Gilbert Clarke and John\u00a0W Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 4 (1964) 568\u2013581. 10.1287\/opre.12.4.568","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/1614191"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_8"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"G.\u00a0A. Croes. 1958. A Method for Solving Traveling-Salesman Problems. Operations Research 6 6 (1958) 791\u2013812. 10.1287\/opre.6.6.791","DOI":"10.1287\/opre.6.6.791"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Carlos\u00a0F. Daganzo. 1984. The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application. Transportation Science 18 4 (1984) 331\u2013350. 10.1287\/trsc.18.4.331","DOI":"10.1287\/trsc.18.4.331"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Merrill\u00a0M. Flood. 1956. The Traveling-Salesman Problem. Operations Research 4 1 (1956) 61\u201375. 10.1287\/opre.4.1.61","DOI":"10.1287\/opre.4.1.61"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Billy\u00a0E. Gillett and Leland\u00a0R. Miller. 1974. A Heuristic Algorithm for the Vehicle-Dispatch Problem. Op. Res. 22 2 (1974) 340\u2013349. 10.1287\/opre.22.2.340","DOI":"10.1287\/opre.22.2.340"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590458"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Diego Pecin Claudio Contardo Guy Desaulniers and Eduardo Uchoa. 2017. New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS Journal on Computing 29 3 (2017) 489\u2013502.","DOI":"10.1287\/ijoc.2016.0744"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Daniel\u00a0J. Rosenkrantz Richard\u00a0E. Stearns and Philip\u00a0M. Lewis II. 1977. An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput. 6 3 (Sept. 1977) 563\u2013581. 10.1137\/0206041","DOI":"10.1137\/0206041"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Marius\u00a0M. Solomon. 1987. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35 2 (1987) 254\u2013265. 10.1287\/opre.35.2.254","DOI":"10.1287\/opre.35.2.254"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Eduardo Uchoa Diego Pecin Artur Pessoa Marcus Poggi Thibaut Vidal and Anand Subramanian. 2017. New Benchmark Instances for the Capacitated Vehicle Routing Problem. European Journal of Operational Research 257 3 (2017) 845\u2013858. 10.1016\/j.ejor.2016.08.012","DOI":"10.1016\/j.ejor.2016.08.012"},{"key":"e_1_3_3_2_19_2","unstructured":"Eduardo Uchoa Diego Pecin Artur Pessoa Marcus Poggi Thibaut Vidal Anand Subramanian and Igor Lima. 2017. CVRPLIB: A Library of Capacitated Vehicle Routing Problem Instances. https:\/\/galgos.inf.puc-rio.br\/cvrplib\/index.php\/en\/instances. Accessed: 2026-04-15."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Thibaut Vidal. 2022. Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Computers & Operations Research 140 (2022) 105643. 10.1016\/j.cor.2021.105643","DOI":"10.1016\/j.cor.2021.105643"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Thibaut Vidal Teodor\u00a0Gabriel Crainic Michel Gendreau Nassira Lahrichi and Walter Rei. 2012. A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60 3 (2012) 611\u2013624. 10.1287\/opre.1120.1048","DOI":"10.1287\/opre.1120.1048"}],"event":{"name":"ICPP '26: Proceedings of the 55th International Conference on Parallel Processing","location":"Singapore , Singapore","acronym":"ICPP '26"},"container-title":["Proceedings of the 55th International Conference on Parallel Processing"],"original-title":[],"deposited":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T18:02:52Z","timestamp":1789581772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3832810.3832887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,27]]},"references-count":20,"alternative-id":["10.1145\/3832810.3832887","10.1145\/3832810"],"URL":"https:\/\/doi.org\/10.1145\/3832810.3832887","relation":{},"subject":[],"published":{"date-parts":[[2026,9,27]]},"assertion":[{"value":"2026-09-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}