{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:26:07Z","timestamp":1771503967939,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T00:00:00Z","timestamp":1737763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T00:00:00Z","timestamp":1737763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306033\/2019-4"],"award-info":[{"award-number":["306033\/2019-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10288-025-00584-0","type":"journal-article","created":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T05:34:20Z","timestamp":1737783260000},"page":"225-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New cuts and a branch-cut-and-price model for the multi-vehicle covering tour problem"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9730-7748","authenticated-orcid":false,"given":"Bruno","family":"Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Pessoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos","family":"Roboredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,25]]},"reference":[{"issue":"3","key":"584_CR1","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2014.10.048","volume":"242","author":"S Allahyari","year":"2015","unstructured":"Allahyari S, Salari M, Vigo D (2015) A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur J Oper Res 242(3):756\u2013768","journal-title":"Eur J Oper Res"},{"issue":"5","key":"584_CR2","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283. https:\/\/doi.org\/10.1287\/opre.1110.0975","journal-title":"Oper Res"},{"issue":"2","key":"584_CR3","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.ejor.2022.07.022","volume":"306","author":"I Ben Mohamed","year":"2023","unstructured":"Ben Mohamed I, Klibi W, Sadykov R, \u015een H, Vanderbeck F (2023) The two-echelon stochastic multi-period capacitated location-routing problem. Eur J Oper Res 306(2):645\u2013667. https:\/\/doi.org\/10.1016\/j.ejor.2022.07.022","journal-title":"Eur J Oper Res"},{"key":"584_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-020-00640-z","author":"T Bulh\u00f5es","year":"2020","unstructured":"Bulh\u00f5es T, Sadykov R, Subramanian A, Uchoa E (2020) On the exact solution of a large class of parallel machine scheduling problems. J Sched. https:\/\/doi.org\/10.1007\/s10951-020-00640-z","journal-title":"J Sched"},{"key":"584_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2014.03.001","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret Optim. https:\/\/doi.org\/10.1016\/j.disopt.2014.03.001","journal-title":"Discret Optim"},{"key":"584_CR6","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s10479-015-2062-7","volume":"258","author":"DA Flores-Garza","year":"2017","unstructured":"Flores-Garza DA, Salazar-Aguilar MA, Ngueveu SU, Laporte G (2017) The multi-vehicle cumulative covering tour problem. Ann Oper Res 258:761\u2013780","journal-title":"Ann Oper Res"},{"issue":"4","key":"584_CR7","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568\u2013576","journal-title":"Oper Res"},{"key":"584_CR8","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.ejor.2019.11.045","volume":"3","author":"E Glize","year":"2020","unstructured":"Glize E, Roberti R, Jozefowiez N, Ngueveu SU (2020) Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems. Eur J Oper Res 3:812\u2013824","journal-title":"Eur J Oper Res"},{"key":"584_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.ejor.2012.11.012","volume":"226","author":"MH Ha","year":"2013","unstructured":"Ha MH, Bostel N, Langevin A, Rousseau LM (2013) An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. Eur J Oper Res 226:211\u2013220","journal-title":"Eur J Oper Res"},{"key":"584_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0305-0548(99)00006-4","volume":"27","author":"M Hachicha","year":"2000","unstructured":"Hachicha M, Hodgson MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Operat Res 27:29\u201342","journal-title":"Comput Operat Res"},{"key":"584_CR11","doi-asserted-by":"publisher","unstructured":"Irnich S, Desaulniers G (2006) Shortest Path Problems with Resource Constraints, pp. 33\u201365. https:\/\/doi.org\/10.1007\/0-387-25486-2_2","DOI":"10.1007\/0-387-25486-2_2"},{"key":"584_CR12","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1002\/net.21564","volume":"64","author":"N Jozefowiez","year":"2014","unstructured":"Jozefowiez N (2014) A branch-and-price algorithm for the multivehicle covering tour problem. Networks 64:160\u2013168","journal-title":"Networks"},{"key":"584_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.endm.2014.11.037","volume":"47","author":"M Kammoun","year":"2015","unstructured":"Kammoun M, Derbel H, Ratli M, Jarboui B (2015) A variable neighborhood search for solving the multi-vehicle covering tour problem. Electron Notes in Discret Math 47:285\u2013292","journal-title":"Electron Notes in Discret Math"},{"issue":"1","key":"584_CR14","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.ejor.2018.05.005","volume":"271","author":"I Karao\u011flan","year":"2018","unstructured":"Karao\u011flan I, Erdo\u011fan G (2018) Ko\u00e7: the multi-vehicle probabilistic covering tour problem. Eur J Oper Res 271(1):278\u2013287","journal-title":"Eur J Oper Res"},{"key":"584_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.endm.2013.10.010","volume":"44","author":"R Lopes","year":"2013","unstructured":"Lopes R, Souza VA, Da Cunha AS (2013) A branch-and-price algorithm for the multi-vehicle covering tour problem. Electron Notes in Discret Math 44:61\u201366","journal-title":"Electron Notes in Discret Math"},{"key":"584_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/net.22041","volume":"79","author":"JT Margolis","year":"2021","unstructured":"Margolis JT, Song Y, Mason SJ (2021) A multi-vehicle covering tour problem with speed optimization. Networks 79:119\u2013142","journal-title":"Networks"},{"key":"584_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0108-8","author":"D Pecin","year":"2016","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2016) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput. https:\/\/doi.org\/10.1007\/s12532-016-0108-8","journal-title":"Math Program Comput"},{"key":"584_CR18","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0784","author":"A Pessoa","year":"2018","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2018) Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS J Comput. https:\/\/doi.org\/10.1287\/ijoc.2017.0784","journal-title":"INFORMS J Comput"},{"key":"584_CR19","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math Program 183:483\u2013523","journal-title":"Math Program"},{"key":"584_CR20","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.cor.2017.07.009","volume":"88","author":"TA Pham","year":"2017","unstructured":"Pham TA, H\u00e0 MH, Nguyen XH (2017) Solving the multi-vehicle multi-covering tour problem. Comput Operat Res 88:258\u2013278","journal-title":"Comput Operat Res"},{"issue":"3","key":"584_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret Optim 3(3):255\u2013273. https:\/\/doi.org\/10.1016\/j.disopt.2006.05.007","journal-title":"Discret Optim"},{"issue":"3","key":"584_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/net.22137","volume":"81","author":"M Roboredo","year":"2023","unstructured":"Roboredo M, Sadykov R, Uchoa E (2023) Solving vehicle routing problems with intermediate stops using vrpsolver models. Networks 81(3):399\u2013416","journal-title":"Networks"},{"key":"584_CR23","unstructured":"R\u00f8pke S (2012) Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation 2012"},{"issue":"1","key":"584_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/trsc.2020.0985","volume":"55","author":"R Sadykov","year":"2021","unstructured":"Sadykov R, Uchoa E, Pessoa A (2021) A bucket graph-based labeling algorithm with application to vehicle routing. Transp Sci 55(1):4\u201328. https:\/\/doi.org\/10.1287\/trsc.2020.0985","journal-title":"Transp Sci"},{"key":"584_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-023-02072-y","author":"VC Soares","year":"2023","unstructured":"Soares VC, Roboredo M (2023) On the exact solution of the multi-depot open vehicle routing problem. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-023-02072-y","journal-title":"Optim Lett"},{"issue":"10","key":"584_CR26","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Operat Res 40(10):2519\u20132531","journal-title":"Comput Operat Res"},{"issue":"3","key":"584_CR27","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845\u2013858","journal-title":"Eur J Oper Res"},{"key":"584_CR28","doi-asserted-by":"publisher","first-page":"105643","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal T (2022) Hybrid genetic search for the CVRP: open-source implementation and swap* neighborhood. Comput Operat Res 140:105643","journal-title":"Comput Operat Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00584-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00584-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00584-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T03:07:43Z","timestamp":1758596863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00584-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,25]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["584"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00584-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,25]]},"assertion":[{"value":"17 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}