{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T04:58:03Z","timestamp":1776920283997,"version":"3.51.2"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T00:00:00Z","timestamp":1620950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T00:00:00Z","timestamp":1620950400000},"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":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s13198-021-01109-8","type":"journal-article","created":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T15:02:25Z","timestamp":1621004545000},"page":"90-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic maximal covering location problem for fire stations under uncertainty: soft-computing approaches"],"prefix":"10.1007","volume":"13","author":[{"given":"Vahid","family":"Hajipour","sequence":"first","affiliation":[]},{"given":"Parviz","family":"Fattahi","sequence":"additional","affiliation":[]},{"given":"Hasan","family":"Bagheri","sequence":"additional","affiliation":[]},{"given":"Samaneh","family":"Babaei Morad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,14]]},"reference":[{"key":"1109_CR1","first-page":"3449","volume":"22","author":"S Afzal","year":"2017","unstructured":"Afzal S, Padmanabh T (2017) Reduced order modelling of linear time invariant system using modified cuckoo search algorithm. Soft Comput 22:3449\u20133459","journal-title":"Soft Comput"},{"key":"1109_CR2","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1007\/s12046-017-0710-0","volume":"42","author":"S Afzal","year":"2017","unstructured":"Afzal S, Rajendra P (2017) New technique for system simplification using cuckoo search and ESA. Sadhana 42:1453\u20131458","journal-title":"Sadhana"},{"key":"1109_CR3","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.cor.2005.03.021","volume":"34","author":"C Araz","year":"2007","unstructured":"Araz C, Selim H, Ozkarahan I (2007) A fuzzy multi-objective covering-based vehicle location model for emergency services. Comput Oper Res 34:705\u2013726","journal-title":"Comput Oper Res"},{"key":"1109_CR4","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/S0377-2217(01)00260-0","volume":"141","author":"H Aytug","year":"2002","unstructured":"Aytug H, Saydam C (2002) Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study. Eur J Oper Res 141:480\u2013494","journal-title":"Eur J Oper Res"},{"key":"1109_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0377-2217(03)00381-3","volume":"159","author":"J Barbas","year":"2004","unstructured":"Barbas J, Marin \u00c1 (2004) Maximal covering code multiplexing access telecommunication networks. Eur J Oper Res 159:219\u2013238","journal-title":"Eur J Oper Res"},{"key":"1109_CR6","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1057\/jors.2010.5","volume":"62","author":"A Basar","year":"2011","unstructured":"Basar A, \u00c7aray B, \u00dcnuyurtt T (2011) A multi-period double coverage approach for locating the emergency medical service stations in Istanbul. J Oper Res Soc 62:627\u2013637","journal-title":"J Oper Res Soc"},{"key":"1109_CR7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ins.2008.08.019","volume":"179","author":"V Batanovic","year":"2009","unstructured":"Batanovic V, Petrovic D, Petrovic R (2009) Fuzzy logic based algorithms for maximum covering location problems. Inf Sci 179:120\u2013129","journal-title":"Inf Sci"},{"key":"1109_CR8","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.cor.2006.03.003","volume":"35","author":"O Berman","year":"2008","unstructured":"Berman O, Huang R (2008) The minimum weighted covering location problem with distance constraints. Comput Oper Res 35:356\u2013372","journal-title":"Comput Oper Res"},{"key":"1109_CR9","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(01)00079-X","volume":"29","author":"O Berman","year":"2002","unstructured":"Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563\u2013581","journal-title":"Comput Oper Res"},{"key":"1109_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ejor.2010.08.016","volume":"208","author":"O Berman","year":"2011","unstructured":"Berman O, Wang J (2011) The minmax regret gradual covering location problem on a network with incomplete information of demand weights. Eur J Oper Res 208:233\u2013238","journal-title":"Eur J Oper Res"},{"key":"1109_CR11","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/opre.1060.0348","volume":"55","author":"O Berman","year":"2007","unstructured":"Berman O, Krass D, Menezes MBC (2007) Facility reliability issues in network p-median problems: strategic centralization and co-location effects. Oper Res 55:332\u2013350","journal-title":"Oper Res"},{"key":"1109_CR12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.2009.00746.x","volume":"41","author":"O Berman","year":"2009","unstructured":"Berman O, Drezner Z, Wesolowky GO (2009) The maximal covering problem with some negative weights. Geogr Anal 41:30\u201342","journal-title":"Geogr Anal"},{"key":"1109_CR13","doi-asserted-by":"crossref","unstructured":"Bhatt R, Parmar G, Gupta R, Sikander A (2018) Application of stochastic fractal search in approximation and control of LTI systems, Microsystem Technologies pp 1\u201310.","DOI":"10.1007\/s00542-018-3939-6"},{"key":"1109_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.cie.2008.11.015","volume":"57","author":"MS Canbolat","year":"2009","unstructured":"Canbolat MS, Vonmassow M (2009) Planar maximal covering with ellipses. Comput Ind Eng 57:201\u2013208","journal-title":"Comput Ind Eng"},{"key":"1109_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.cor.2015.09.003","volume":"67","author":"F Colombo","year":"2016","unstructured":"Colombo F, Cordone R, Lulli G (2016) The multimode covering location problem. Comput Oper Res 67:25\u201333","journal-title":"Comput Oper Res"},{"key":"1109_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s11067-007-9035-6","volume":"10","author":"KM Curtin","year":"2010","unstructured":"Curtin KM, Hayslett-Mccall K, Qie F (2010) Determining optimal police patrol areas with maximal covering and backup covering location models. Netw Spat Econ 10:125\u2013145","journal-title":"Netw Spat Econ"},{"key":"1109_CR17","doi-asserted-by":"crossref","first-page":"2729","DOI":"10.1016\/j.cor.2008.11.015","volume":"36","author":"CF De Assis","year":"2009","unstructured":"De Assis CF, Lorena LAN, Ribeiro GM (2009) A decomposition approach for the probabilistic maximal covering location-allocation problem. Comput Oper Res 36:2729\u20132739","journal-title":"Comput Oper Res"},{"key":"1109_CR18","unstructured":"Eberhart R, Kennedy J (1995) A New Optimizer Using Particle Swarm Theory, In: Proceedings of the sixth international symposium on machine and human science, pp 39\u201343."},{"key":"1109_CR19","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2007.07.004","volume":"190","author":"ET Erdemir","year":"2008","unstructured":"Erdemir ET, Battar SS, Rogerson PA, Blatt A, Flanigan M (2008) Location coverage models with demand originating from nodes and paths: application to cellular network design. Eur J Oper Res 190:610\u2013632","journal-title":"Eur J Oper Res"},{"key":"1109_CR20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0305-0548(01)00087-9","volume":"30","author":"LGA Espejo","year":"2003","unstructured":"Espejo LGA, Galvao RD, Boffey B (2003) Dual-based heuristics for a hierarchical covering location problem. Comput Oper Res 30:165\u2013180","journal-title":"Comput Oper Res"},{"key":"1109_CR21","first-page":"141","volume":"2","author":"J Fajardo Calder\u00edn","year":"2017","unstructured":"Fajardo Calder\u00edn J, Nodarse CP, Year LS, Diago E, Rodr\u00edgue E (2017) Software tool for model and solve the maximum coverage location problem a case study: location police officers. Revista Invest Oper 2:141\u2013149","journal-title":"Revista Invest Oper"},{"key":"1109_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.cie.2014.06.012","volume":"75","author":"Z Farahanir","year":"2014","unstructured":"Farahanir Z, Hassani A, Mousavis M, Bayagi MB (2014) A hybrid artificial bee colony for disruption in a hierarchical maximal covering location problem. Comput Ind Eng 75:129\u2013141","journal-title":"Comput Ind Eng"},{"key":"1109_CR23","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0377-2217(99)00171-X","volume":"124","author":"RD Galvao","year":"2000","unstructured":"Galvao RD, Espejo LGA, Boffey B (2000a) A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur J Oper Res 124:377\u2013389","journal-title":"Eur J Oper Res"},{"key":"1109_CR24","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0377-2217(99)00171-X","volume":"124","author":"RD Galvao","year":"2000","unstructured":"Galvao RD, Gonzalo AcostaC Espejo L, Boffey B (2000b) A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur J Oper Res 124:377\u2013389","journal-title":"Eur J Oper Res"},{"key":"1109_CR25","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S0377-2217(01)00172-2","volume":"138","author":"RD Galvao","year":"2002","unstructured":"Galvao RD, Espejo LGA, Boffeyb B (2002) A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro. Eur J Oper Res 138:495\u2013517","journal-title":"Eur J Oper Res"},{"key":"1109_CR26","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/S0167-8191(01)00103-X","volume":"27","author":"M Gendreau","year":"2001","unstructured":"Gendreau M, Laporte G, Semet F (2001) A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput 27:1641\u20131653","journal-title":"Parallel Comput"},{"key":"1109_CR27","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(82)90159-X","volume":"10","author":"G Gumawarane","year":"1982","unstructured":"Gumawarane G (1982) Dynamic versions of set covering type public facility location problems. Eur J Oper Res 10:190\u2013195","journal-title":"Eur J Oper Res"},{"key":"1109_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cor.2016.01.001","volume":"70","author":"V Hajipour","year":"2016","unstructured":"Hajipour V, Zanjiranifarahani R, Fattahi P (2016) Bi-objective vibration damping optimization for congested location-pricing problem. Comput Oper Res 70:87\u2013100","journal-title":"Comput Oper Res"},{"key":"1109_CR29","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s00500-016-2398-1","volume":"22","author":"H Hasanzadeh","year":"2018","unstructured":"Hasanzadeh H, Bashiri M, Amiri A (2018) A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming. A Soft Comput 22:949. https:\/\/doi.org\/10.1007\/s00500-016-2398-1","journal-title":"A Soft Comput"},{"key":"1109_CR30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.37917\/ijeee.12.2.7","volume":"12","author":"MK Ibrahim","year":"2016","unstructured":"Ibrahim MK, Ali RS (2016) Novel optimization algorithm inspired by camel traveling behavior. Iraq J Electric Electron Eng 12:167\u2013178","journal-title":"Iraq J Electric Electron Eng"},{"key":"1109_CR31","unstructured":"Jeetendra A, Girish P Rajeev G, Afzal S (2018) Analysis of grey wolf optimizer based fractional order PID controller in speed control of DC motor. Microsystem Technologies pp 1\u201310"},{"key":"1109_CR60","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"key":"1109_CR32","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/S0305-0548(03)00105-9","volume":"31","author":"O Karasakal","year":"2004","unstructured":"Karasakal O, Karasakale K (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:1515\u20131526","journal-title":"Comput Oper Res"},{"key":"1109_CR33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s13198-016-0466-7","volume":"9","author":"T Kumar Sharma","year":"2018","unstructured":"Kumar Sharma T, Millie P (2018) Identification of noise in multi noise plant using enhanced version of shuffled frog leaping algorithm. Int J Syst Assur Eng Manage 9:43\u201351","journal-title":"Int J Syst Assur Eng Manage"},{"key":"1109_CR34","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.cie.2010.01.005","volume":"58","author":"JM Lee","year":"2010","unstructured":"Lee JM, Lee YH (2010) Tabu based heuristics for the generalized hierarchical covering location problem. Comput Ind Eng 58:638\u2013645","journal-title":"Comput Ind Eng"},{"key":"1109_CR35","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2012.11.012","volume":"40","author":"Q Li","year":"2013","unstructured":"Li Q, Zeng B, Savachkin A (2013) Reliable facility location design under disruptions. Comput Oper Res 40:901\u2013909","journal-title":"Comput Oper Res"},{"key":"1109_CR36","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0038-0121(94)90003-5","volume":"28","author":"V Marianov","year":"1994","unstructured":"Marianov V, Revelle C (1994) The queuing probabilistic location set covering problem and some extensions. Socioecon Plann Sci 28:167\u2013178","journal-title":"Socioecon Plann Sci"},{"key":"1109_CR37","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0377-2217(00)00314-3","volume":"135","author":"V Marianov","year":"2001","unstructured":"Marianov V, Serra D (2001) Hierarchical location\u2013allocation models for congested systems. Eur J Oper Res 135:195\u2013208","journal-title":"Eur J Oper Res"},{"key":"1109_CR38","doi-asserted-by":"crossref","unstructured":"Masegosa AD, de la Iglesia I, Hernandez-Jayo U, Diez LE, Bahillo A, Onieva E (2018) A New Approach for Information Dissemination in VANETs Based on Covering Location and Metaheuristics. In: Cruz Corona C (eds) Soft computing for sustainability science. studies in fuzziness and soft computing, vol 358. Springer, Cham","DOI":"10.1007\/978-3-319-62359-7_9"},{"key":"1109_CR39","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/mnsc.28.7.775","volume":"28","author":"GC Moore","year":"1982","unstructured":"Moore GC, Revelle C (1982) The hierarchical service location problem. Manage Sci 28:775\u2013780","journal-title":"Manage Sci"},{"key":"1109_CR40","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.seps.2008.02.012","volume":"43","author":"L Murawski","year":"2009","unstructured":"Murawski L, Church RL (2009) Improving accessibility to rural health services: The maximal covering network improvement problem. Socioecon Plann Sci 43:102\u2013110","journal-title":"Socioecon Plann Sci"},{"key":"1109_CR41","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2010.08.030","volume":"209","author":"JRRL O\u2019hanleyChurch","year":"2011","unstructured":"O\u2019hanleyChurch JRRL (2011) Designing robust coverage networks to hedge against worst-case facility losses. Eur J Oper Res 209:23\u201336","journal-title":"Eur J Oper Res"},{"key":"1109_CR42","doi-asserted-by":"crossref","first-page":"2640","DOI":"10.1016\/j.fss.2009.02.021","volume":"160","author":"D Peidro","year":"2009","unstructured":"Peidro D, Mula J, Poler R, Verdegay JL (2009) Fuzzy optimization for supply chain planning under supply, demand and process uncertainties. Fuzzy Sets Syst 160:2640\u20132657","journal-title":"Fuzzy Sets Syst"},{"key":"1109_CR43","doi-asserted-by":"crossref","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:1890\u20131894","journal-title":"Comput Math Appl"},{"key":"1109_CR44","doi-asserted-by":"crossref","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 multiperiod set covering location model for dynamic redeployment of ambulances. Comput Oper Res 35:814\u2013826","journal-title":"Comput Oper Res"},{"key":"1109_CR45","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.seps.2008.02.011","volume":"43","author":"SJ Ratick","year":"2009","unstructured":"Ratick SJ, Osleeb JP, Hozumi D (2009) Application and extension of the Moore and ReVelle hierarchical maximal covering model. Socioecon Plann Sci 43:92\u2013101","journal-title":"Socioecon Plann Sci"},{"key":"1109_CR46","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0377-2217(94)90297-6","volume":"75","author":"JF Repede","year":"1994","unstructured":"Repede JF, Bernado JJ (1994) Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. Eur J Oper Res 75:567\u2013581","journal-title":"Eur J Oper Res"},{"key":"1109_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2003.11.032","volume":"165","author":"CS Revelle","year":"2005","unstructured":"Revelle CS, Eiselt HA (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165:1\u201319","journal-title":"Eur J Oper Res"},{"key":"1109_CR48","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.cor.2006.03.007","volume":"35","author":"C Revelle","year":"2008","unstructured":"Revelle C, Scholssberg M, Williams J (2008a) Solving the maximal covering location problem with heuristic concentration. Comput Oper Res 35:427\u2013435","journal-title":"Comput Oper Res"},{"key":"1109_CR49","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.ejor.2006.12.044","volume":"184","author":"CS Revelle","year":"2008","unstructured":"Revelle CS, Eiselt HA, Daaskin MS (2008b) A bibliography for some fundamental problem categories in discrete location science. Eur J Oper Res 184:817\u2013848","journal-title":"Eur J Oper Res"},{"key":"1109_CR50","doi-asserted-by":"crossref","first-page":"2310","DOI":"10.1016\/j.cor.2005.09.005","volume":"34","author":"G \u015eahin","year":"2007","unstructured":"\u015eahin G, Sural H (2007) A review of hierarchical facility location models. Comput Oper Res 34:2310\u20132331","journal-title":"Comput Oper Res"},{"key":"1109_CR51","first-page":"153","volume":"31","author":"A Sait","year":"2013","unstructured":"Sait A, Uymaz GT, E, (2013) Artificial algae algorithm(AAA) for nonlinear global optimization. Appl Soft Comput 31:153\u2013157","journal-title":"Appl Soft Comput"},{"key":"1109_CR52","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1111\/j.1540-5915.1980.tb01172.x","volume":"11","author":"A Schillingd","year":"1980","unstructured":"Schillingd A (1980) Dynamic location modeling for public-sector facilities: a multicriteria approach. Decis Sci 11:714\u2013724","journal-title":"Decis Sci"},{"key":"1109_CR53","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.amc.2005.12.058","volume":"181","author":"H Shandi","year":"2006","unstructured":"Shandi H, Mahloohi H (2006) A fuzzy queuing location model with a genetic algorithm for congested systems. Appl Math Comput 181:440\u2013456","journal-title":"Appl Math Comput"},{"key":"1109_CR54","first-page":"171","volume":"1","author":"H Shandi","year":"2007","unstructured":"Shandi H, Mahloohi H (2007) Fuzzy hierarchical location-allocation models for congested systems. J Indus Syst Eng 1:171\u2013189","journal-title":"J Indus Syst Eng"},{"key":"1109_CR55","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/ijoc.1100.0414","volume":"23","author":"ZJM Shen","year":"2011","unstructured":"Shen ZJM, Zhan RL, Zhang J (2011) The reliable facility location problem: formulations, heuristics, and approximation algorithms. INFORMS J Comput 23:470\u2013482","journal-title":"INFORMS J Comput"},{"key":"1109_CR56","doi-asserted-by":"crossref","unstructured":"Shi Y (2015) An optimization algorithm based on brainstorming process. Emerging Research on Swarm Intelligence and Algorithm Optimization, pp 1\u201335.","DOI":"10.4018\/978-1-4666-6328-2.ch001"},{"key":"1109_CR57","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"LV Snyder","year":"2005","unstructured":"Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39:400\u2013416","journal-title":"Transp Sci"},{"key":"1109_CR58","doi-asserted-by":"crossref","unstructured":"Xia L, Xie M, Xu W, Shao J, Yin W, Dong J (2009) An empirical comparison of five efficient heuristics for maximal covering location problems. Service Operations, Logistics and Informatics. SOLI'09 IEEE\/INFORMS International Conference on IEEE 747\u2013753","DOI":"10.1109\/SOLI.2009.5204032"},{"key":"1109_CR59","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0377-2217(03)00389-8","volume":"159","author":"H Younies","year":"2004","unstructured":"Younies H, Wesolowsky GO (2004) A mixed integer formulation for maximal covering by inclined parallelograms. Eur J Oper Res 159:83\u201394","journal-title":"Eur J Oper Res"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-021-01109-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13198-021-01109-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-021-01109-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T19:13:03Z","timestamp":1699038783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13198-021-01109-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,14]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1109"],"URL":"https:\/\/doi.org\/10.1007\/s13198-021-01109-8","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"value":"0975-6809","type":"print"},{"value":"0976-4348","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,14]]},"assertion":[{"value":"6 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}