{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T12:08:40Z","timestamp":1779538120103,"version":"3.53.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["APQ-02473-24"],"award-info":[{"award-number":["APQ-02473-24"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["BPG-00026-24"],"award-info":[{"award-number":["BPG-00026-24"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["409785\/2023-7"],"award-info":[{"award-number":["409785\/2023-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306264\/2025-0"],"award-info":[{"award-number":["306264\/2025-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100022823","name":"Centro Federal de Educa\u00e7\u00e3o Tecnol\u00f3gica de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100022823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018218","name":"Universidade Estadual de Montes Claros","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100018218","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12351-026-01027-2","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:52:04Z","timestamp":1773683524000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A GVNS algorithm applied to the uncapacitated single allocation hub maximal covering problem with fixed costs"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7323-1355","authenticated-orcid":false,"given":"Fernando F\u00e9lix","family":"Oliveira e Silva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7801-0087","authenticated-orcid":false,"given":"Elisangela Martins","family":"de S\u00e1","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7831-6740","authenticated-orcid":false,"given":"S\u00e9rgio Ricardo","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"issue":"10","key":"1027_CR1","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1057\/jors.2008.92","volume":"60","author":"S Alumur","year":"2009","unstructured":"Alumur S, Kara BY (2009) A hub covering network design problem for cargo applications in turkey. J Oper Res Soc 60(10):1349\u20131359. https:\/\/doi.org\/10.1057\/jors.2008.92","journal-title":"J Oper Res Soc"},{"key":"1027_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11590-015-0973-5","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg J, Mladenovi\u0107 N, Todosijevi\u0107 R, Uro\u0161evi\u0107 D (2017) A basic variable neighborhood search heuristic for the uncapacitated multiple allocation $$p$$-hub center problem. Optim Lett 11:313\u2013327","journal-title":"Optim Lett"},{"key":"1027_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1111\/1467-9787.00134","volume":"39","author":"D Bryan","year":"1999","unstructured":"Bryan D, O\u2019Kelly M (1999) Hub-and-spoke networks in air transportation: an analytical review. J Reg Sci 39:275\u2013295. https:\/\/doi.org\/10.1111\/1467-9787.00134","journal-title":"J Reg Sci"},{"issue":"12","key":"1027_CR4","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1016\/j.cor.2008.11.023","volume":"36","author":"H Cal\u0131k","year":"2009","unstructured":"Cal\u0131k H, Alumur SA, Kara BY, Karasan OE (2009) A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput Oper Res 36(12):3088\u20133096. https:\/\/doi.org\/10.1016\/j.cor.2008.11.023","journal-title":"Comput Oper Res"},{"issue":"2","key":"1027_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387\u2013405","journal-title":"Eur J Oper Res"},{"key":"1027_CR6","first-page":"522","volume":"1","author":"S Chanta","year":"2019","unstructured":"Chanta S, Sangsawang O (2019) A single allocation p-hub maximal covering model for optimizing railway station location. Intell Comput Optim 1:522\u2013530","journal-title":"Intell Comput Optim"},{"issue":"1","key":"1027_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0377-2217(92)90181-8","volume":"62","author":"S Chung","year":"1992","unstructured":"Chung S, Myung Y, Tcha D (1992) Optimal design of a distributed network with a two-level hierarchical structure. Eur J Oper Res 62(1):105\u2013115. https:\/\/doi.org\/10.1016\/0377-2217(92)90181-8","journal-title":"Eur J Oper Res"},{"key":"1027_CR8","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"IA Contreras","year":"2011","unstructured":"Contreras IA, Cordeau JF, Laporte G (2011) Benders decomposition for large-scale uncapacitated hub location. Oper Res 59:1477\u20131490. https:\/\/doi.org\/10.1287\/opre.1110.0965","journal-title":"Oper Res"},{"issue":"4","key":"1027_CR9","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.cor.2006.07.002","volume":"35","author":"R de Camargo","year":"2008","unstructured":"de Camargo R, Miranda G, Luna H (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput Oper Res 35(4):1047\u20131064. https:\/\/doi.org\/10.1016\/j.cor.2006.07.002","journal-title":"Comput Oper Res"},{"key":"1027_CR10","doi-asserted-by":"crossref","unstructured":"Ernst AT, Jiang H, Krishanmoorthy M, Baatar D (2011) Reformulations and computational results for the uncapacitated single allocation hub covering problem. In: Data and decision sciences in action: proceedings of the Australian society for operations research conference 2011. (pp. 133\u2013148)","DOI":"10.1007\/978-3-319-55914-8_10"},{"issue":"3","key":"1027_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139\u2013154. https:\/\/doi.org\/10.1016\/S0966-8349(96)00011-3. ((Hub Location))","journal-title":"Locat Sci"},{"issue":"4","key":"1027_CR12","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096\u20131109","journal-title":"Comput Ind Eng"},{"key":"1027_CR13","unstructured":"Hamacher HW, Meyer T (2006) Hub cover and hub center problems Technical paper No.98. Department of Mathematics, University of Kaiserslautern, Germany. https:\/\/nbn-resolving.de\/urn:nbn:de:hbz:386-kluedo-14350"},{"key":"1027_CR14","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, Brimberg J, P\u00e9rez JAM (2019) Variable neighborhood search. In: Gendreau M and Potvin JY (Eds.), Handbook of metaheuristics. Springer International Publishing, Cham. pp. 57\u201397","DOI":"10.1007\/978-3-319-91086-4_3"},{"issue":"2","key":"1027_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.cie.2012.03.014","volume":"63","author":"YH Hwang","year":"2012","unstructured":"Hwang YH, Lee YH (2012) Uncapacitated single allocation p-hub maximal covering problem. Comput Ind Eng 63(2):382\u2013389. https:\/\/doi.org\/10.1016\/j.cie.2012.03.014","journal-title":"Comput Ind Eng"},{"issue":"2","key":"1027_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107 A, Uro\u0161evi\u0107 D, Brimberg J, Mladenovi\u0107 N (2010) A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res 206(2):289\u2013300. https:\/\/doi.org\/10.1016\/j.ejor.2010.02.022","journal-title":"Eur J Oper Res"},{"issue":"1\u20132","key":"1027_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-017-2508-1","volume":"259","author":"O Jankovi\u0107","year":"2017","unstructured":"Jankovi\u0107 O, Mi\u0161kovi\u0107 S, Stanimirovi\u0107 Z, Todosijevi\u0107 R (2017) Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems. Ann Oper Res 259(1\u20132):191\u2013216. https:\/\/doi.org\/10.1007\/s10479-017-2508-1","journal-title":"Ann Oper Res"},{"key":"1027_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.endm.2017.03.004","volume":"58","author":"O Jankovi\u0107","year":"2017","unstructured":"Jankovi\u0107 O, Stanimirovi\u0107 Z (2017) A general variable neighborhood search for solving the uncapacitated $$r$$-allocation $$p$$-hub maximal covering problem. Electron Notes Discrete Math 58:23\u201330. https:\/\/doi.org\/10.1016\/j.endm.2017.03.004","journal-title":"Electron Notes Discrete Math"},{"key":"1027_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1057\/palgrave.jors.2601473","volume":"54","author":"B Kara","year":"2003","unstructured":"Kara B, Tansel B (2003) The single-assignment hub covering problem: models and linearizations. J Oper Res Soc 54:59\u201364. https:\/\/doi.org\/10.1057\/palgrave.jors.2601473","journal-title":"J Oper Res Soc"},{"key":"1027_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123802","volume":"249","author":"A Karimi","year":"2024","unstructured":"Karimi A, Masehian E (2024) Modeling, landscape analysis, and solving the capacitated single-allocation hub maximal covering problem using the garvnd hybrid algorithm. Expert Syst Appl 249:123802. https:\/\/doi.org\/10.1016\/j.eswa.2024.123802","journal-title":"Expert Syst Appl"},{"key":"1027_CR21","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jairtraman.2017.09.001","volume":"68","author":"SR Madani","year":"2018","unstructured":"Madani SR, Nookabadi AS, Hejazi SR (2018) A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach. J Air Transp Manag 68:118\u2013136. https:\/\/doi.org\/10.1016\/j.jairtraman.2017.09.001","journal-title":"J Air Transp Manag"},{"key":"1027_CR22","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2023.2196726","author":"M Maleki","year":"2023","unstructured":"Maleki M, Majlesinasab N, Sinha AK (2023) An efficient model for the multiple allocation hub maximal covering problem. Optim Methods Softw. https:\/\/doi.org\/10.1080\/10556788.2023.2196726","journal-title":"Optim Methods Softw"},{"issue":"2","key":"1027_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0377-2217(98)00195-7","volume":"114","author":"V Marianov","year":"1999","unstructured":"Marianov V, Serra D, ReVelle C (1999) Location of hubs in a competitive environment. Eur J Oper Res 114(2):363\u2013371. https:\/\/doi.org\/10.1016\/S0377-2217(98)00195-7","journal-title":"Eur J Oper Res"},{"issue":"12","key":"1027_CR24","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2008.07.011","volume":"36","author":"T Meyer","year":"2009","unstructured":"Meyer T, Ernst AT, Krishnamoorthy M (2009) A 2-phase algorithm for solving the single allocation $$p$$-hub center problem. Comput Oper Res 36(12):3143\u20133151. https:\/\/doi.org\/10.1016\/j.cor.2008.07.011","journal-title":"Comput Oper Res"},{"issue":"11","key":"1027_CR25","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/978-3-319-91086-4_3","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100. https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3","journal-title":"Comput Oper Res"},{"key":"1027_CR26","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2009","unstructured":"Montgomery DC, Hoboken (2009) Design and analysis of experiments, 7th edn. John Wiley & Sons, Hoboken","edition":"7"},{"issue":"3","key":"1027_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32(3):393\u2013404. https:\/\/doi.org\/10.1016\/S0377-2217(87)80007-3","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1027_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01434269","volume":"71","author":"ME O\u2019Kelly","year":"1992","unstructured":"O\u2019Kelly ME (1992) Hub facility location with fixed costs. Pap Reg Sci 71(3):293\u2013306. https:\/\/doi.org\/10.1007\/BF01434269","journal-title":"Pap Reg Sci"},{"key":"1027_CR29","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.omega.2015.01.009","volume":"54","author":"M Peker","year":"2015","unstructured":"Peker M, Kara BY (2015) The $$p$$-hub maximal covering problem and extensions for gradual decay functions. Omega 54:158\u2013172. https:\/\/doi.org\/10.1016\/j.omega.2015.01.009","journal-title":"Omega"},{"issue":"11\u201312","key":"1027_CR30","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1016\/j.camwa.2008.10.004","volume":"57","author":"B Qu","year":"2009","unstructured":"Qu B, Weng K (2009) Path relinking approach for multiple allocation hub maximal covering problem. Comput Math Appl 57(11\u201312):1890\u20131894. https:\/\/doi.org\/10.1016\/j.camwa.2008.10.004","journal-title":"Comput Math Appl"},{"key":"1027_CR31","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.ejor.2017.03.066","volume":"262","author":"MR Silva","year":"2017","unstructured":"Silva MR, Cunha CB (2017) A tabu search heuristic for the uncapacitated single allocation p -hub maximal covering problem. Eur J Oper Res 262:954\u2013965. https:\/\/doi.org\/10.1016\/j.ejor.2017.03.066","journal-title":"Eur J Oper Res"},{"key":"1027_CR32","doi-asserted-by":"crossref","unstructured":"Todosijevi\u0107 R, Stan\u010di\u0107 O, Stanimirovi\u0107 Z, Mi\u0161kovi\u0107 S (2024) General variable neighborhood search for the capacitated single allocation hub maximal covering problem. Top, pp. 1\u201342","DOI":"10.1007\/s11750-024-00685-9"},{"issue":"7","key":"1027_CR33","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1057\/palgrave.jors.2602424","volume":"59","author":"B Wagner","year":"2008","unstructured":"Wagner B (2008) Model formulations for hub covering problems. J Oper Res Soc 59(7):932\u2013938. https:\/\/doi.org\/10.1057\/palgrave.jors.2602424","journal-title":"J Oper Res Soc"},{"key":"1027_CR34","doi-asserted-by":"crossref","unstructured":"Weng Kr, Yang C, Ma Yf (2006) Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem. In: Huang DS, Li K, and Irwin GW (eds.), Intelligent computing. Springer, pp. 737\u2013744","DOI":"10.1007\/11816157_90"},{"issue":"3","key":"1027_CR35","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2011.01.014","volume":"211","author":"H Yaman","year":"2011","unstructured":"Yaman H (2011) Allocation strategies in hub networks. Eur J Oper Res 211(3):442\u2013451. https:\/\/doi.org\/10.1016\/j.ejor.2011.01.014","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01027-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01027-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01027-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T11:50:08Z","timestamp":1779537008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01027-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1027"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01027-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]},"assertion":[{"value":"19 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors Fernando F\u00e9lix Oliveira e Silva, Elisangela Martins de S\u00e1, and S\u00e9rgio Ricardo de Souza declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"38"}}