{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T09:37:57Z","timestamp":1771666677153,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"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":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s43069-020-00050-z","type":"journal-article","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T11:03:14Z","timestamp":1615806194000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Accelerated Benders Decomposition Algorithm for Solving a Double-Type Double-Standard Maximal Covering Location Problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Ashkan","family":"Fakhri","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Fragkogios","sequence":"additional","affiliation":[]},{"given":"Georgios K. D.","family":"Saharidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,15]]},"reference":[{"issue":"3","key":"50_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0165-4896(85)90059-9","volume":"9","author":"H Cremer","year":"1985","unstructured":"Cremer H, De Kerchove AM, Thisse JF (1985) An economic theory of public facilities in space. Math Soc Sci 9(3):249\u2013262","journal-title":"Math Soc Sci"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.apgeog.2011.11.013","volume":"34","author":"P Yin","year":"2012","unstructured":"Yin P, Mu L (2012) Modular capacitated maximal covering location problem for the optimal siting of emergency vehicles. Appl Geogr 34:247\u2013254","journal-title":"Appl Geogr"},{"issue":"1","key":"50_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church R, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci 32(1):101\u2013118","journal-title":"Pap Reg Sci"},{"issue":"2","key":"50_CR4","first-page":"77","volume":"5","author":"M Gendreau","year":"1997","unstructured":"Gendreau M, Laporte G, Semet F (1997) Solving an ambulance location model by tabu search. Loc Sci 5(2):77\u201388","journal-title":"Loc Sci"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Laporte G, Louveaux F, Semet\u00a0F, hirion\u00a0A (2009) Application of the double standard model for ambulance location, In: Nunen J., Speranza M., Bertazzi L. (eds) Innovations in Distribution Logistics. Lecture Notes in Econom and Math Systems, vol. 619, Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-92944-4_12"},{"issue":"11","key":"50_CR6","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1287\/mnsc.32.11.1434","volume":"32","author":"K Hogan","year":"1986","unstructured":"Hogan K, ReVelle CS (1986) Concepts and applications of backup coverage. Manage Sci 32(11):1434\u20131444","journal-title":"Manage Sci"},{"issue":"1","key":"50_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/trsc.17.1.48","volume":"17","author":"MS Daskin","year":"1983","unstructured":"Daskin MS (1983) Maximum expected covering location model: formulation, properties and heuristic solution. Transp Sci 17(1):48\u201370","journal-title":"Transp Sci"},{"key":"50_CR8","unstructured":"Karaman\u00a0M (2008) A Genetic algorithm for the multi-level maximal covering ambulance location problem, Master of Science Thesis: Middle East Technical University"},{"key":"50_CR9","first-page":"231","volume":"21","author":"MS Jabalameli","year":"2010","unstructured":"Jabalameli MS, Bankian Tabrizi B, Moshref Javadi M (2010) Capacitated facility location problem with variable coverage radius in distribution system. Int J Ind Eng Prod Res 21:231\u2013237","journal-title":"Int J Ind Eng Prod Res"},{"issue":"1","key":"50_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.seps.2011.04.004","volume":"46","author":"AM Caunhye","year":"2012","unstructured":"Caunhye AM, Nie X, Pokharel S (2012) Optimization models in emergency logistics: a literature review. Socio-Econ Plan Sci 46(1):4\u201313","journal-title":"Socio-Econ Plan Sci"},{"issue":"10","key":"50_CR11","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1080\/02331934.2013.820297","volume":"62","author":"MdC Marques","year":"2013","unstructured":"Marques MdC, Dias JM (2013) Simple dynamic location problem with uncertainty: a primal-dual heuristic approach. Optimization 62(10):1379\u20131397","journal-title":"Optimization"},{"issue":"3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.cor.2006.04.003","volume":"35","author":"HK Rajagopalan","year":"2008","unstructured":"Rajagopalan HK, Saydam C, Xiao J (2008) A multi-period set covering location model for dynamic redeployment of ambulances. Comput Oper Res 35(3):814\u2013826","journal-title":"Comput Oper Res"},{"issue":"3","key":"50_CR13","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.ejor.2010.06.033","volume":"207","author":"V Schmid","year":"2010","unstructured":"Schmid V, Doerner KF (2010) Ambulance location and relocation problems with time-dependent travel times. Eur J Oper Res 207(3):1293\u20131303","journal-title":"Eur J Oper Res"},{"issue":"1","key":"50_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10479-011-1050-9","volume":"210","author":"L Tang","year":"2013","unstructured":"Tang L, Jiang W, Saharidis G (2013) An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions. Ann Oper Res 210(1):165\u2013190","journal-title":"Ann Oper Res"},{"key":"50_CR15","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.cie.2018.07.047","volume":"124","author":"M Rohaninejad","year":"2018","unstructured":"Rohaninejad M, Sahraeian R, Tavakkoli Moghaddam R (2018) An accelerated Benders decomposition algorithm for reliable facility location problems in multi-echelon networks. Comput Ind Eng 124:523\u2013534","journal-title":"Comput Ind Eng"},{"issue":"3","key":"50_CR16","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejor.2018.12.021","volume":"275","author":"JF Cordeau","year":"2019","unstructured":"Cordeau JF, Furini F, Ljubic I (2019) Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur J Oper Res 275(3):882\u2013896","journal-title":"Eur J Oper Res"},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/s00521-016-2606-z","volume":"29","author":"F Karamyar","year":"2018","unstructured":"Karamyar F, Sadeghi J, Modarres Yazdi M (2018) A Benders decomposition for the location-allocation and scheduling model in a healthcare system regarding robust optimization. Neural Comput Appl 29:873\u2013886","journal-title":"Neural Comput Appl"},{"key":"50_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11590-019-01401-4","volume":"14","author":"A Hosseininasab","year":"2020","unstructured":"Hosseininasab A, Gzara F (2020) Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem. Optim Lett 14:171\u2013193","journal-title":"Optim Lett"},{"issue":"3","key":"50_CR19","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801\u2013817","journal-title":"Eur J Oper Res"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"Fragkogios A, Saharidis GK (2018) Latest advances on Benders decomposition, in Encyclopedia of Information Science and Technology, Fourth Edition, IGI GLOBAL, 5411\u20135421","DOI":"10.4018\/978-1-5225-2255-3.ch470"},{"key":"50_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-010-0398-y","volume":"132","author":"A Agnetis","year":"2012","unstructured":"Agnetis A, Grande E, Pacifici A (2012) Demand allocation with latency cost functions. Math Program Ser A 132:277\u2013294","journal-title":"Math Program Ser A"},{"key":"50_CR22","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2017.07.017","volume":"89","author":"A Fakhri","year":"2017","unstructured":"Fakhri A, Ghatee M, Fragkogios A, Saharidis G (2017) Benders decomposition with integer subproblem. Expert Syst Appl 89:20\u201330","journal-title":"Expert Syst Appl"},{"key":"50_CR23","first-page":"1192","volume":"254","author":"A Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri A (1962) Caract\u00e9risation des Matrices Totalement Unimodulaires. C R Acad Sci Paris 254:1192\u20131194","journal-title":"C R Acad Sci Paris"},{"issue":"5","key":"50_CR24","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1090\/S0002-9939-1965-0180568-2","volume":"16","author":"P Camion","year":"1965","unstructured":"Camion P (1965) Characterization of totally unimodular matrices. Proc Am Math Soc 16(5):1068\u20131073","journal-title":"Proc Am Math Soc"},{"key":"50_CR25","doi-asserted-by":"crossref","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2010) Linear programming and network flows-4th ed., Wiley, New Jersey.","DOI":"10.1002\/9780471703778"},{"key":"50_CR26","unstructured":"Black PE (2019) Manhattan distance, in Dictionary of Algorithms and Data Structures [online]."}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00050-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00050-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00050-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:23:20Z","timestamp":1637241800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00050-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00050-z","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"4 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The author declares that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"15"}}