{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T04:01:17Z","timestamp":1781064077250,"version":"3.54.1"},"reference-count":78,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ic.2026.105477","type":"journal-article","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T14:46:06Z","timestamp":1779029166000},"page":"105477","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Enhanced approximation algorithms for the capacitated location routing problem"],"prefix":"10.1016","volume":"311","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2322-750X","authenticated-orcid":false,"given":"Jingyang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shunwang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0001","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1111\/j.1467-9787.1961.tb01276.x","article-title":"The relationship between transportation costs and location rent in transportation problems","volume":"3","author":"Von Boventer","year":"1961","journal-title":"J. Reg. Sci."},{"issue":"3","key":"10.1016\/j.ic.2026.105477_bib0002","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1057\/jors.1964.47","article-title":"On the location of supply points to minimize transport costs","volume":"15","author":"Maranzana","year":"1964","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"10.1016\/j.ic.2026.105477_bib0003","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1057\/jors.1968.74","article-title":"Cost functions in the location of depots for multiple-delivery journeys","volume":"19","author":"Webb","year":"1968","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","article-title":"A survey of recent research on location-routing problems","volume":"238","author":"Prodhon","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0005","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.ejor.2014.08.030","article-title":"A survey of variants and extensions of the location-routing problem","volume":"241","author":"Drexl","year":"2015","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0006","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10479-017-2509-0","article-title":"A survey of the standard location-routing problem","volume":"259","author":"Schneider","year":"2017","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0007","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","article-title":"A two-phase tabu search approach to the location routing problem","volume":"116","author":"Tuzun","year":"1999","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.ic.2026.105477_bib0008","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","article-title":"Using clustering analysis in a capacitated location-routing problem","volume":"179","author":"Barreto","year":"2007","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0009","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/opre.1050.0228","article-title":"Approximation algorithms for problems combining facility location and network design","volume":"54","author":"Ravi","year":"2006","journal-title":"Oper. Res."},{"key":"10.1016\/j.ic.2026.105477_bib0010","series-title":"Vehicle Routing: Problems, Methods, and Applications","author":"Toth","year":"2014"},{"key":"10.1016\/j.ic.2026.105477_bib0011","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","article-title":"A literature review on the vehicle routing problem with multiple depots","volume":"79","author":"Montoya-Torres","year":"2015","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0012","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/151002320","article-title":"LP-based algorithms for capacitated facility location","volume":"46","author":"An","year":"2017","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2026.105477_bib0013","series-title":"AAAI 2015","first-page":"3432","article-title":"An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem","author":"Zhang","year":"2015"},{"key":"10.1016\/j.ic.2026.105477_bib0014","series-title":"AAAI 2021","first-page":"12042","article-title":"Multi-decoder attention model with embedding glimpse for solving vehicle routing problems","author":"Xin","year":"2021"},{"key":"10.1016\/j.ic.2026.105477_bib0015","series-title":"ICML 2023","first-page":"42769","article-title":"Towards omni-generalizable neural methods for vehicle routing problems","volume":"Vol. 202","author":"Zhou","year":"2023"},{"issue":"9","key":"10.1016\/j.ic.2026.105477_bib0016","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02023807","article-title":"An exact algorithm for solving a capacitated location-routing problem","volume":"6","author":"Laporte","year":"1986","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/j.ic.2026.105477_bib0017","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","article-title":"Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking","volume":"4","author":"Prins","year":"2006","journal-title":"4OR"},{"issue":"5","key":"10.1016\/j.ic.2026.105477_bib0018","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1287\/trsc.2019.0943","article-title":"A hybrid metaheuristic for single truck and trailer routing problems","volume":"54","author":"Accorsi","year":"2020","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0019","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/trsc.2017.0770","article-title":"Large composite neighborhoods for the capacitated location-routing problem","volume":"53","author":"Schneider","year":"2019","journal-title":"Transp. Sci."},{"key":"10.1016\/j.ic.2026.105477_bib0020","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2023.0416.cd","article-title":"A hybrid genetic algorithm with multi-population for capacitated location routing","author":"He","year":"2025","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"10.1016\/j.ic.2026.105477_bib0021","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","article-title":"A branch-and-cut method for the capacitated location-routing problem","volume":"38","author":"Belenguer","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ic.2026.105477_bib0022","series-title":"Operations Research and Cyber-Infrastructure","first-page":"309","article-title":"A branch-and-price algorithm for combined location and routing problems under capacity restrictions","author":"Akca","year":"2009"},{"issue":"5","key":"10.1016\/j.ic.2026.105477_bib0023","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1287\/opre.1110.0989","article-title":"An exact method for the capacitated location-routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0024","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/ijoc.2013.0549","article-title":"An exact algorithm based on cut-and-column generation for the capacitated location-routing problem","volume":"26","author":"Contardo","year":"2014","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"10.1016\/j.ic.2026.105477_bib0025","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1287\/opre.2023.2458","article-title":"Nonrobust strong knapsack cuts for capacitated location routing and related problems","volume":"71","author":"Liguori","year":"2023","journal-title":"Oper. Res."},{"issue":"17","key":"10.1016\/j.ic.2026.105477_bib0026","first-page":"7499","article-title":"Using greedy clustering method to solve capacitated location-routing problem","volume":"5","author":"Nadizadeh","year":"2011","journal-title":"Afr. J. Bus. Manag."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0027","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejor.2013.02.013","article-title":"Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands","volume":"229","author":"Mehrjerdi","year":"2013","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"10.1016\/j.ic.2026.105477_bib0028","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","article-title":"A GRASP\u202f\u00d7\u202f ELS approach for the capacitated location-routing problem","volume":"37","author":"Duhamel","year":"2010","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0029","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-013-9230-1","article-title":"A GRASP+ ILP-based metaheuristic for the capacitated location-routing problem","volume":"20","author":"Contardo","year":"2014","journal-title":"J. Heuristics"},{"key":"10.1016\/j.ic.2026.105477_bib0030","series-title":"European Conference on Evolutionary Computation in Combinatorial Optimization","first-page":"183","article-title":"A memetic algorithm with population management (MA| PM) for the capacitated location-routing problem","author":"Prins","year":"2006"},{"key":"10.1016\/j.ic.2026.105477_bib0031","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2016.01.006","article-title":"A simple and effective evolutionary algorithm for the capacitated location\u2013routing problem","volume":"70","author":"Lopes","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0032","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1287\/trsc.2023.0369","article-title":"Genetic algorithms with neural cost predictor for solving hierarchical vehicle routing problems","volume":"59","author":"Sobhanan","year":"2025","journal-title":"Transp. Sci."},{"issue":"12","key":"10.1016\/j.ic.2026.105477_bib0033","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","article-title":"An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics","volume":"39","author":"Hemmelmayr","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ic.2026.105477_bib0034","article-title":"A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem","volume":"168","author":"Akpunar","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ic.2026.105477_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105856","article-title":"Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions","volume":"146","author":"Voigt","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0036","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ijpe.2012.06.011","article-title":"A multiple ant colony optimization algorithm for the capacitated location routing problem","volume":"141","author":"Ting","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.ic.2026.105477_bib0037","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.trb.2014.05.014","article-title":"A granular variable tabu neighborhood search for the capacitated location-routing problem","volume":"67","author":"Escobar","year":"2014","journal-title":"Transp. Res. B: Methodol."},{"issue":"5","key":"10.1016\/j.ic.2026.105477_bib0038","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1111\/itor.12322","article-title":"A biased-randomized metaheuristic for the capacitated location routing problem","volume":"24","author":"Quintero-Araujo","year":"2017","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.ic.2026.105477_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105166","article-title":"A progressive filtering heuristic for the location-routing problem and variants","volume":"129","author":"Arnold","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ic.2026.105477_bib0040","series-title":"Technical Report","article-title":"Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem","author":"Christofides","year":"1976"},{"key":"10.1016\/j.ic.2026.105477_bib0041","first-page":"76","article-title":"Some extremal bypasses in graphs","volume":"17","author":"Serdyukov","year":"1978","journal-title":"Upr. Sist."},{"key":"10.1016\/j.ic.2026.105477_bib0042","series-title":"STOC 2021","first-page":"32","article-title":"A (slightly) improved approximation algorithm for metric TSP","author":"Karlin","year":"2021"},{"key":"10.1016\/j.ic.2026.105477_bib0043","series-title":"IPCO 2023","first-page":"261","article-title":"A deterministic better-than-3\/2 approximation algorithm for metric TSP","volume":"13904","author":"Karlin","year":"2023"},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0044","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/TASE.2006.872110","article-title":"A resource allocation algorithm for multivehicle systems with nonholonomic constraints","volume":"4","author":"Rathinam","year":"2007","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"10.1016\/j.ic.2026.105477_bib0045","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.orl.2011.03.002","article-title":"An analysis of the extended christofides heuristic for the k-depot TSP","volume":"39","author":"Xu","year":"2011","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.ic.2026.105477_bib0046","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1287\/ijoc.2015.0650","article-title":"A 3\/2-approximation algorithm for the multiple TSP with a fixed number of depots","volume":"27","author":"Xu","year":"2015","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.ic.2026.105477_bib0047","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/20M135594X","article-title":"Reducing path TSP to TSP","volume":"51","author":"Traub","year":"2022","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2026.105477_bib0048","series-title":"ESA 2023","first-page":"39:1","article-title":"A (3\/2 + \u03b5)-approximation for multiple TSP with a variable number of depots","volume":"Vol. 274","author":"Deppert","year":"2023"},{"issue":"4","key":"10.1016\/j.ic.2026.105477_bib0049","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","article-title":"Bounds and heuristics for capacitated routing problems","volume":"10","author":"Haimovich","year":"1985","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.ic.2026.105477_bib0050","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","article-title":"Heuristics for unequal weight delivery problems with a fixed error guarantee","volume":"6","author":"Altinkemer","year":"1987","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0051","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/ijoc.2.1.64","article-title":"Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems","volume":"2","author":"Li","year":"1990","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0052","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.1120.0423","article-title":"Approximation algorithms for capacitated location routing","volume":"47","author":"Harks","year":"2013","journal-title":"Transp. Sci."},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0053","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-022-01841-4","article-title":"Improving the approximation ratio for capacitated vehicle routing","volume":"197","author":"Blauth","year":"2023","journal-title":"Math. Program."},{"key":"10.1016\/j.ic.2026.105477_bib0054","series-title":"IPCO 2022","first-page":"251","article-title":"Improved approximations for capacitated vehicle routing with unsplittable client demands","volume":"13265","author":"Friggstad","year":"2022"},{"key":"10.1016\/j.ic.2026.105477_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115265","article-title":"Multidepot capacitated vehicle routing with improved approximation guarantees","volume":"1043","author":"Zhao","year":"2025","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.ic.2026.105477_bib0056","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1287\/ijoc.2021.0193","article-title":"An approximation algorithm for k-depot split delivery vehicle routing problem","volume":"35","author":"Lai","year":"2023","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.ic.2026.105477_bib0057","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"issue":"6","key":"10.1016\/j.ic.2026.105477_bib0058","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1145\/950620.950621","article-title":"Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP","volume":"50","author":"Jain","year":"2003","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0059","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539703405754","article-title":"Improved approximation algorithms for the uncapacitated facility location problem","volume":"33","author":"Chudak","year":"2003","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/j.ic.2026.105477_bib0060","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1137\/070708901","article-title":"An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem","volume":"39","author":"Byrka","year":"2010","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2026.105477_bib0061","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","article-title":"A 1.488 approximation algorithm for the uncapacitated facility location problem","volume":"222","author":"Li","year":"2013","journal-title":"Inf. Comput."},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0062","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ejor.2022.04.028","article-title":"Bifactor approximation for location routing with vehicle and facility capacities","volume":"304","author":"Heine","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.ic.2026.105477_bib0063","series-title":"ESA","first-page":"133","article-title":"A 5-approximation for capacitated facility location","author":"Bansal","year":"2012"},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0064","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10107-012-0565-4","article-title":"A 3-approximation algorithm for the facility location problem with uniform capacities","volume":"141","author":"Aggarwal","year":"2013","journal-title":"Math. Program."},{"issue":"7","key":"10.1016\/j.ic.2026.105477_bib0065","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.3390\/math13071023","article-title":"A survey of approximation algorithms for the universal facility location problem","volume":"13","author":"Xiao","year":"2025","journal-title":"Mathematics"},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0066","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/net.21683","article-title":"Locating depots for capacitated vehicle routing","volume":"68","author":"G\u00f8rtz","year":"2016","journal-title":"Networks"},{"key":"10.1016\/j.ic.2026.105477_bib0067","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"issue":"4","key":"10.1016\/j.ic.2026.105477_bib0068","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/trsc.1060.0187","article-title":"Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic","volume":"41","author":"Prins","year":"2007","journal-title":"Transp. Sci."},{"key":"10.1016\/j.ic.2026.105477_bib0069","article-title":"The capacitated location routing problem","volume":"2009","author":"Baldacci","year":"2009","journal-title":"ROUTE"},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0070","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0071","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.ic.2026.105477_bib0072","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","article-title":"Improved approximation algorithms for the facility location problems with linear\/submodular penalties","volume":"73","author":"Li","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.ic.2026.105477_bib0073","series-title":"STOC 2024","first-page":"1641","article-title":"Prize-collecting steiner tree: A 1.79 approximation","author":"Ahmadi","year":"2024"},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0074","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-025-02221-4","article-title":"A better-than-1.6-approximation for prize-collecting TSP","volume":"216","author":"Blauth","year":"2026","journal-title":"Math. Program."},{"issue":"17","key":"10.1016\/j.ic.2026.105477_bib0075","doi-asserted-by":"crossref","first-page":"3238","DOI":"10.1016\/j.dam.2008.05.013","article-title":"Approximation algorithms for group prize-collecting and location-routing problems","volume":"156","author":"Glicksman","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.ic.2026.105477_bib0076","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2432622.2432628","article-title":"Steiner tree approximation via iterative randomized rounding","volume":"60","author":"Byrka","year":"2013","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2026.105477_bib0077","series-title":"Combinatorial Optimization II","first-page":"121","article-title":"Heuristic analysis, linear programming and branch and bound","author":"Wolsey","year":"2009"},{"key":"10.1016\/j.ic.2026.105477_bib0078","series-title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024, Jeju, South Korea, August 3\u20139, 2024","first-page":"6805","article-title":"Improved approximation algorithms for capacitated location routing","author":"Zhao","year":"2024"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089054012600074X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089054012600074X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T03:22:54Z","timestamp":1781061774000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S089054012600074X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":78,"alternative-id":["S089054012600074X"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105477","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enhanced approximation algorithms for the capacitated location routing problem","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105477","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105477"}}