{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:43:01Z","timestamp":1776793381181,"version":"3.51.2"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s40314-021-01650-z","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T16:54:02Z","timestamp":1632761642000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4363-1112","authenticated-orcid":false,"given":"Nader","family":"Ghaffarinasab","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Motallebzadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"issue":"1","key":"1650_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh F, Goldfarb D (2003) Second-order cone programming. Math Program 95(1):3\u201351","journal-title":"Math Program"},{"key":"1650_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.trc.2018.12.011","volume":"102","author":"F Alkaabneh","year":"2019","unstructured":"Alkaabneh F, Diabat A, Elhedhli S (2019) A Lagrangian heuristic and grasp for the hub-and-spoke network system with economies-of-scale and congestion. Transp Res Part C Emerg Technol 102:249\u2013273","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"1","key":"1650_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"10","key":"1650_CR4","doi-asserted-by":"crossref","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","journal-title":"J Oper Res Soc"},{"key":"1650_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.apm.2017.10.033","volume":"55","author":"SA Alumur","year":"2018","unstructured":"Alumur SA, Nickel S, Rohrbeck B, Saldanha-da Gama F (2018) Modeling congestion and service time in hub location problems. Appl Math Model 55:13\u201332","journal-title":"Appl Math Model"},{"issue":"1","key":"1650_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2020.09.039","volume":"291","author":"SA Alumur","year":"2021","unstructured":"Alumur SA, Campbell JF, Contreras I, Kara BY, Marianov V, O\u2019Kelly ME (2021) Perspectives on modeling hub location problems. Eur J Oper Res 291(1):1\u201317","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1650_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s40314-014-0179-y","volume":"35","author":"FH Boukani","year":"2016","unstructured":"Boukani FH, Moghaddam BF, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35(1):45\u201360","journal-title":"Comput Appl Math"},{"key":"1650_CR8","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12801","author":"J Brimberg","year":"2021","unstructured":"Brimberg J, Mi\u0161kovi\u0107 S, Todosijevi\u0107 R, Uro\u0161evic D (2021) The uncapacitated r-allocation p-hub center problem. Int Trans Oper Res. https:\/\/doi.org\/10.1111\/itor.12801","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"1650_CR9","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1287\/opre.44.6.923","volume":"44","author":"JF Campbell","year":"1996","unstructured":"Campbell JF (1996) Hub location and the p-hub median problem. Oper Res 44(6):923\u2013935","journal-title":"Oper Res"},{"issue":"2","key":"1650_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell JF, O\u2019Kelly ME (2012) Twenty-five years of hub location research. Transp Sci 46(2):153\u2013169","journal-title":"Transp Sci"},{"issue":"1","key":"1650_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u1ef3","year":"1985","unstructured":"\u010cern\u1ef3 V (1985) Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45(1):41\u201351","journal-title":"J Optim Theory Appl"},{"key":"1650_CR12","doi-asserted-by":"crossref","unstructured":"Contreras I, O\u2019Kelly M (2019) Hub location problems. In: Laporte G, Nickel S, Saldanha-daGama F (eds) Location science, chapt. 12, 2nd edn. Springer, Heidelberg, pp 327\u2013363","DOI":"10.1007\/978-3-030-32177-2_12"},{"issue":"1","key":"1650_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-019-1025-z","volume":"39","author":"DD \u010cvoki\u0107","year":"2020","unstructured":"\u010cvoki\u0107 DD, Stanimirovi\u0107 Z (2020) A single allocation hub location and pricing problem. Comput Appl Math 39(1):1\u201324","journal-title":"Comput Appl Math"},{"issue":"3","key":"1650_CR14","doi-asserted-by":"crossref","first-page":"3385","DOI":"10.1016\/j.eswa.2011.09.026","volume":"39","author":"RS de Camargo","year":"2012","unstructured":"de Camargo RS, Miranda G (2012) Single allocation hub location problem under congestion: network owner and user perspectives. Expert Syst Appl 39(3):3385\u20133391","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1650_CR15","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.orl.2011.06.015","volume":"39","author":"RS De Camargo","year":"2011","unstructured":"De Camargo RS, de Miranda Jr G, Ferreira RP (2011) A hybrid outer-approximation\/benders decomposition algorithm for the single allocation hub location problem under congestion. Oper Res Lett 39(5):329\u2013337","journal-title":"Oper Res Lett"},{"issue":"6","key":"1650_CR16","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.cor.2003.11.016","volume":"32","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput Oper Res 32(6):1615\u20131632","journal-title":"Comput Oper Res"},{"issue":"2","key":"1650_CR17","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/ijoc.1090.0335","volume":"22","author":"S Elhedhli","year":"2010","unstructured":"Elhedhli S, Wu H (2010) A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS J Comput 22(2):282\u2013296","journal-title":"INFORMS J Comput"},{"issue":"3","key":"1650_CR18","doi-asserted-by":"crossref","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","journal-title":"Locat Sci"},{"issue":"1","key":"1650_CR19","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0377-2217(96)00340-2","volume":"104","author":"AT Ernst","year":"1998","unstructured":"Ernst AT, Krishnamoorthy M (1998) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur J Oper Res 104(1):100\u2013112","journal-title":"Eur J Oper Res"},{"key":"1650_CR20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann Oper Res 86:141\u2013159","journal-title":"Ann Oper Res"},{"issue":"4","key":"1650_CR21","doi-asserted-by":"crossref","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":"1650_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau M, Potvin JY et al (2010) Handbook of metaheuristics, vol 2. Springer, Berlin"},{"key":"1650_CR23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2018.04.021","volume":"97","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab N (2018) An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Comput Oper Res 97:31\u201347","journal-title":"Comput Oper Res"},{"issue":"3","key":"1650_CR24","first-page":"213","volume":"15","author":"N Ghaffarinasab","year":"2020","unstructured":"Ghaffarinasab N (2020) A tabu search heuristic for the bi-objective star hub location problem. Int J Manag Sci Eng Manag 15(3):213\u2013225","journal-title":"Int J Manag Sci Eng Manag"},{"issue":"1","key":"1650_CR25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s11067-018-9424-z","volume":"19","author":"N Ghaffarinasab","year":"2019","unstructured":"Ghaffarinasab N, Kara BY (2019) Benders decomposition algorithms for two variants of the single allocation hub location problem. Netw Spat Econ 19(1):83\u2013108","journal-title":"Netw Spat Econ"},{"issue":"2","key":"1650_CR26","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.ejor.2017.11.058","volume":"267","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab N, Motallebzadeh A (2018) Hub interdiction problem variants: models and metaheuristic solution algorithms. Eur J Oper Res 267(2):496\u2013512","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1650_CR27","first-page":"919","volume":"20","author":"N Ghaffari-Nasab","year":"2013","unstructured":"Ghaffari-Nasab N, Ahari SG, Ghazanfari M (2013a) A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands. Sci Iran 20(3):919\u2013930","journal-title":"Sci Iran"},{"issue":"2","key":"1650_CR28","first-page":"140","volume":"15","author":"N Ghaffari-Nasab","year":"2013","unstructured":"Ghaffari-Nasab N, Jabalameli MS, Saboury A (2013b) Multi-objective capacitated location-routing problem: modelling and a simulated annealing heuristic. Int J Serv Oper Manag 15(2):140\u2013156","journal-title":"Int J Serv Oper Manag"},{"issue":"1","key":"1650_CR29","first-page":"61","volume":"8","author":"N Ghaffarinasab","year":"2017","unstructured":"Ghaffarinasab N, Jabarzadeh Y, Motallebzadeh A (2017) A tabu search based solution approach to the competitive multiple allocation hub location problem. Iran J Oper Res 8(1):61\u201377","journal-title":"Iran J Oper Res"},{"key":"1650_CR30","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.cor.2017.09.022","volume":"90","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab N, Motallebzadeh A, Jabarzadeh Y, Kara BY (2018) Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Comput Oper Res 90:173\u2013192","journal-title":"Comput Oper Res"},{"issue":"3","key":"1650_CR31","first-page":"184","volume":"15","author":"N Ghaffarinasab","year":"2020","unstructured":"Ghaffarinasab N, Zare Andaryan A, Ebadi Torkayesh A (2020) Robust single allocation p-hub median problem under hose and hybrid demand uncertainties: models and algorithms. Int J Manag Sci Eng Manag 15(3):184\u2013195","journal-title":"Int J Manag Sci Eng Manag"},{"issue":"1","key":"1650_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3141\/1662-01","volume":"1662","author":"D Gillen","year":"1999","unstructured":"Gillen D, Levinson D (1999) Full cost of air travel in the California corridor. Transp Res Rec 1662(1):1\u20139","journal-title":"Transp Res Rec"},{"key":"1650_CR33","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck O, Linderoth J (2008) Perspective relaxation of mixed integer nonlinear programs with indicator variables. In: Lodi A, Panconesi A, Rinaldi, G (eds) IPCO, Lecture Notes in Computer Science, vol 5035. pp 1\u201316","DOI":"10.1007\/978-3-540-68891-4_1"},{"key":"1650_CR34","unstructured":"Hamacher HW, Meyer T (2006) Hub cover and hub center problems. Working paper"},{"issue":"3","key":"1650_CR35","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.ejor.2012.03.010","volume":"220","author":"R Ishfaq","year":"2012","unstructured":"Ishfaq R, Sox CR (2012) Design of intermodal logistics networks with hub delays. Eur J Oper Res 220(3):629\u2013641","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1650_CR36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1504\/IJMHEUR.2012.048213","volume":"2","author":"MS Jabalameli","year":"2012","unstructured":"Jabalameli MS, Barzinpour F, Saboury A, Ghaffari-Nasab N (2012) A simulated annealing-based heuristic for the single allocation maximal covering hub location problem. Int J Metaheuristics 2(1):15\u201337","journal-title":"Int J Metaheuristics"},{"key":"1650_CR37","doi-asserted-by":"crossref","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 Discret Math 58:23\u201330","journal-title":"Electron Notes Discret Math"},{"key":"1650_CR38","doi-asserted-by":"crossref","first-page":"102069","DOI":"10.1016\/j.tre.2020.102069","volume":"142","author":"M Karimi-Mamaghan","year":"2020","unstructured":"Karimi-Mamaghan M, Mohammadi M, Pirayesh A, Karimi-Mamaghan AM, Irani H (2020) Hub-and-spoke network design under congestion: a learning based metaheuristic. Transp Res Part E Logist Transp Rev 142:102069","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"1650_CR39","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.cie.2016.09.019","volume":"101","author":"R Kian","year":"2016","unstructured":"Kian R, Kargar K (2016) Comparison of the formulations for a hub-and-spoke network design problem under congestion. Comput Ind Eng 101:504\u2013512","journal-title":"Comput Ind Eng"},{"key":"1650_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2018.10.019","volume":"119","author":"\u00c7a\u011fr\u0131 \u00d6zg\u00fcn Kibiro\u011flu","year":"2019","unstructured":"Kibiro\u011flu \u00c7a\u011fr\u0131 \u00d6zg\u00fcn, Serarslan MN, \u0130lker Topcu Y (2019) Particle swarm optimization for uncapacitated multiple allocation hub location problem under congestion. Expert Syst Appl 119:1\u201319","journal-title":"Expert Syst Appl"},{"issue":"4598","key":"1650_CR41","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1\u20133","key":"1650_CR42","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo MS, Vandenberghe L, Boyd S, Lebret H (1998) Applications of second-order cone programming. Linear Algebra Appl 284(1\u20133):193\u2013228","journal-title":"Linear Algebra Appl"},{"key":"1650_CR43","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.cie.2018.12.058","volume":"128","author":"A L\u00fcer-Villagra","year":"2019","unstructured":"L\u00fcer-Villagra A, Eiselt HA, Marianov V (2019) A single allocation p-hub median problem with general piecewise-linear costs in arcs. Comput Ind Eng 128:477\u2013491","journal-title":"Comput Ind Eng"},{"issue":"7","key":"1650_CR44","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/S0305-0548(02)00052-7","volume":"30","author":"V Marianov","year":"2003","unstructured":"Marianov V, Serra D (2003) Location models for airline hubs behaving as M\/D\/c queues. Comput Oper Res 30(7):983\u20131003","journal-title":"Comput Oper Res"},{"issue":"4","key":"1650_CR45","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1257\/000282803769206269","volume":"93","author":"C Mayer","year":"2003","unstructured":"Mayer C, Sinai T (2003) Network effects, congestion externalities, and air traffic delays: or why not all delays are evil. Am Econ Rev 93(4):1194\u20131215","journal-title":"Am Econ Rev"},{"key":"1650_CR46","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.tre.2019.01.008","volume":"123","author":"M Mohammadi","year":"2019","unstructured":"Mohammadi M, Jula P, Tavakkoli-Moghaddam R (2019) Reliable single-allocation hub location problem with disruptions. Transp Res Part E Logist Transp Rev 123:90\u2013120","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"1650_CR47","unstructured":"Nemirovski A (2001) Lectures on modern convex optimization. Society for Industrial and Applied Mathematics"},{"issue":"2","key":"1650_CR48","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/10556789208805510","volume":"1","author":"Y Nesterov","year":"1992","unstructured":"Nesterov Y, Nemirovsky A (1992) Conic formulation of a convex programming problem and duality. Optim Methods Softw 1(2):95\u2013115","journal-title":"Optim Methods Softw"},{"issue":"4","key":"1650_CR49","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1111\/j.1538-4632.1986.tb00106.x","volume":"18","author":"ME O\u2019Kelly","year":"1986","unstructured":"O\u2019Kelly ME (1986) Activity levels at hub facilities in interacting networks. Geogr Anal 18(4):343\u2013356","journal-title":"Geogr Anal"},{"issue":"3","key":"1650_CR50","doi-asserted-by":"crossref","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","journal-title":"Eur J Oper Res"},{"key":"1650_CR51","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2013.08.026","volume":"43","author":"J Peir\u00f3","year":"2014","unstructured":"Peir\u00f3 J, Corber\u00e1n \u00c1, Mart\u00ed R (2014) Grasp for the uncapacitated r-allocation p-hub median problem. Comput Oper Res 43:50\u201360","journal-title":"Comput Oper Res"},{"issue":"4","key":"1650_CR52","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1111\/itor.12441","volume":"25","author":"J Peir\u00f3","year":"2018","unstructured":"Peir\u00f3 J, Corber\u00e1n \u00c1, Laguna M, Mart\u00ed R (2018) Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem. Int Trans Oper Res 25(4):1241\u20131267","journal-title":"Int Trans Oper Res"},{"issue":"5\u20136","key":"1650_CR53","doi-asserted-by":"crossref","first-page":"4179","DOI":"10.1016\/j.apm.2015.11.019","volume":"40","author":"Y Rahimi","year":"2016","unstructured":"Rahimi Y, Tavakkoli-Moghaddam R, Mohammadi M, Sadeghi M (2016) Multi-objective hub network design under uncertainty considering congestion: an M\/M\/c\/K queue system. Appl Math Model 40(5\u20136):4179\u20134198","journal-title":"Appl Math Model"},{"issue":"1","key":"1650_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-020-01405-2","volume":"40","author":"R Rahmati","year":"2021","unstructured":"Rahmati R, Neghabi H (2021) Adjustable robust balanced hub location problem with uncertain transportation cost. Comput Appl Math 40(1):1\u201328","journal-title":"Comput Appl Math"},{"issue":"10","key":"1650_CR55","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1016\/j.cor.2013.01.008","volume":"40","author":"A Saboury","year":"2013","unstructured":"Saboury A, Ghaffari-Nasab N, Barzinpour F, Jabalameli MS (2013) Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. Comput Oper Res 40(10):2493\u20132507","journal-title":"Comput Oper Res"},{"issue":"12","key":"1650_CR56","doi-asserted-by":"crossref","first-page":"3152","DOI":"10.1016\/j.cor.2008.12.019","volume":"36","author":"MR Silva","year":"2009","unstructured":"Silva MR, Cunha CB (2009) New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput Oper Res 36(12):3152\u20133165","journal-title":"Comput Oper Res"},{"issue":"3","key":"1650_CR57","doi-asserted-by":"crossref","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(3):954\u2013965","journal-title":"Eur J Oper Res"},{"key":"1650_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2018.05.016","volume":"86","author":"G Taherkhani","year":"2019","unstructured":"Taherkhani G, Alumur SA (2019) Profit maximizing hub location problems. Omega 86:1\u201315","journal-title":"Omega"},{"issue":"1","key":"1650_CR59","first-page":"28","volume":"49","author":"PZ Tan","year":"2007","unstructured":"Tan PZ, Kara BY (2007) A hub covering model for cargo delivery systems. Netw Int J 49(1):28\u201339","journal-title":"Netw Int J"},{"issue":"3","key":"1650_CR60","doi-asserted-by":"crossref","first-page":"3334","DOI":"10.1007\/s40314-017-0512-3","volume":"37","author":"H Tikani","year":"2018","unstructured":"Tikani H, Honarvar M, Mehrjerdi YZ (2018) Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry. Comput Appl Math 37(3):3334\u20133364","journal-title":"Comput Appl Math"},{"issue":"6","key":"1650_CR61","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1007\/s11590-015-0867-6","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107 R, Uro\u0161evi\u0107 D, Mladenovi\u0107 N, Hanafi S (2017) A general variable neighborhood search for solving the uncapacitated $$r$$-allocation $$p$$-hub median problem. Optim Lett 11(6):1109\u20131121","journal-title":"Optim Lett"},{"issue":"4","key":"1650_CR62","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/j.cor.2003.09.008","volume":"32","author":"H Topcuoglu","year":"2005","unstructured":"Topcuoglu H, Corut F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location problem using genetic algorithms. Comput Oper Res 32(4):967\u2013984","journal-title":"Comput Oper Res"},{"key":"1650_CR63","doi-asserted-by":"crossref","unstructured":"Van Laarhoven PJ, Aarts EH (1987) Simulated annealing. In: Simulated annealing: theory and applications. Springer, Dordrecht. pp 7\u201315","DOI":"10.1007\/978-94-015-7744-1_2"},{"issue":"3","key":"1650_CR64","doi-asserted-by":"crossref","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","journal-title":"Eur J Oper Res"},{"issue":"12","key":"1650_CR65","doi-asserted-by":"crossref","first-page":"4424","DOI":"10.1016\/j.apm.2009.03.018","volume":"33","author":"TH Yang","year":"2009","unstructured":"Yang TH (2009) Stochastic air freight hub location and flight routes planning. Appl Math Model 33(12):4424\u20134430","journal-title":"Appl Math Model"},{"issue":"2","key":"1650_CR66","first-page":"69","volume":"33","author":"TH Yang","year":"2016","unstructured":"Yang TH, Chiu TY (2016) Airline hub-and-spoke system design under stochastic demand and hub congestion. J Ind Prod Eng 33(2):69\u201376","journal-title":"J Ind Prod Eng"},{"key":"1650_CR67","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.trb.2014.10.004","volume":"71","author":"B Y\u0131ld\u0131z","year":"2015","unstructured":"Y\u0131ld\u0131z B, Kara\u015fan OE (2015) Regenerator location problem and survivable extensions: a hub covering location perspective. Transp Res Part B Methodol 71:32\u201355","journal-title":"Transp Res Part B Methodol"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01650-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01650-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01650-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T12:15:10Z","timestamp":1633608910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01650-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":67,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1650"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01650-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"5 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"251"}}