{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T07:14:53Z","timestamp":1722842093086},"reference-count":61,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["11971372","11991020","11991021","12021001"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101048"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2403400"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1016\/j.ejor.2023.04.044","type":"journal-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T20:40:57Z","timestamp":1683319257000},"page":"73-87","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient presolving methods for solving maximal covering and partial set covering location problems"],"prefix":"10.1016","volume":"311","author":[{"given":"Liang","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5543-8988","authenticated-orcid":false,"given":"Sheng-Jie","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4147-1346","authenticated-orcid":false,"given":"Wei-Kun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Quan","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2023.04.044_bib0001","series-title":"Constraint integer programming","author":"Achterberg","year":"2007"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0002","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","article-title":"Presolve reductions in mixed integer programming","volume":"32","author":"Achterberg","year":"2020","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2023.04.044_bib0003","series-title":"Facets of combinatorial optimization: Festschrift for martin gr\u00f6tschel","first-page":"449","article-title":"Mixed integer programming: Analyzing 12 years of progress","author":"Achterberg","year":"2013"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0004","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0305-0483(96)00058-8","article-title":"A simple search heuristic for the MCLP: Application to the location of ambulance bases in a rural region","volume":"25","author":"Adenso-Diaz","year":"1997","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2023.04.044_bib0005","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.1475-3995.2008.00626.x","article-title":"A three-phase methodology for developing or evaluating bank networks","volume":"15","author":"Alexandris","year":"2008","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0006","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01586000","article-title":"Presolving in linear programming","volume":"71","author":"Andersen","year":"1995","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0007","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.ejor.2019.11.036","article-title":"On the fuzzy maximal covering location problem","volume":"283","author":"Arana-Jim\u00e9nez","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0008","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1287\/ijoc.2016.0722","article-title":"Planar maximum coverage location problem with partial coverage and rectangular demand and service zones","volume":"29","author":"Bansal","year":"2017","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0009","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-6377(87)90004-6","article-title":"A note on detecting simple redundancies in linear systems","volume":"6","author":"Bixby","year":"1987","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2023.04.044_bib0010","doi-asserted-by":"crossref","first-page":"105310","DOI":"10.1016\/j.cor.2021.105310","article-title":"Continuous maximal covering location problems with interconnected facilities","volume":"132","author":"Blanco","year":"2021","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0011","series-title":"Aspects of set packing, partitioning and covering","author":"Bornd\u00f6rfer","year":"1998"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0012","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2021.02.032","article-title":"Conditional facility location problems with continuous demand and a polygonal barrier","volume":"296","author":"Byrne","year":"2022","journal-title":"European journal of operational research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0013","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.cie.2008.11.015","article-title":"Planar maximal covering with ellipses","volume":"57","author":"Canbolat","year":"2009","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.ejor.2023.04.044_bib0014","unstructured":"Chen, S.-J., Chen, W.-K., Dai, Y.-H., Yuan, J.-H., & Zhang, H.-S. (2021). Efficient presolving methods for the influence maximization problem in social networks. http:\/\/www.optimization-online.org\/DB_FILE\/2021\/01\/8189.pdf."},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0015","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1467-9787.1984.tb01031.x","article-title":"The planar maximal covering location problem","volume":"24","author":"Church","year":"1984","journal-title":"Journal of Regional Science"},{"key":"10.1016\/j.ejor.2023.04.044_bib0016","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","article-title":"The maximal covering location problem","volume":"32","author":"Church","year":"1974","journal-title":"Papers of the Regional Science Association"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0017","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.ejor.2018.12.021","article-title":"Benders decomposition for very large scale partial set covering and maximal covering location problems","volume":"275","author":"Cordeau","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0018","series-title":"Introduction to algorithms","author":"Cormen","year":"2009"},{"key":"10.1016\/j.ejor.2023.04.044_bib0019","unstructured":"CPLEX (2022). User\u2019s Manual for CPLEX. https:\/\/www.ibm.com\/docs\/en\/icos\/20.1.0?topic=cplex-users-manual."},{"key":"10.1016\/j.ejor.2023.04.044_bib0020","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1111\/j.1538-4632.1990.tb00199.x","article-title":"Analysis of errors due to demand data aggregation in the set covering and maximal covering location problem","volume":"22","author":"Current","year":"1990","journal-title":"Geographical Analysis"},{"key":"10.1016\/j.ejor.2023.04.044_bib0021","series-title":"Network and discrete location: Models, algorithms, and applications","author":"Daskin","year":"2013"},{"key":"10.1016\/j.ejor.2023.04.044_bib0022","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02097799","article-title":"Aggregation effects in maximum covering models","volume":"18","author":"Daskin","year":"1989","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0023","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1111\/j.1538-4632.1999.tb00979.x","article-title":"Two new location covering problems: The partial p-center problem and the partial set covering problem","volume":"31","author":"Daskin","year":"1999","journal-title":"Geographical Analysis"},{"key":"10.1016\/j.ejor.2023.04.044_bib0024","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1111\/1475-3995.00330","article-title":"Spatial optimization of resources deployment for forest-fire management","volume":"8","author":"Dimopoulou","year":"2001","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0025","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/(SICI)1520-6750(199604)43:3<435::AID-NAV8>3.0.CO;2-A","article-title":"An exact algorithm for the maximal covering problem","volume":"43","author":"Downs","year":"1996","journal-title":"Naval Research Logistics"},{"issue":"6","key":"10.1016\/j.ejor.2023.04.044_bib0026","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/mnsc.27.6.658","article-title":"A branch and bound algorithm for the list selection problem in direct mail advertising","volume":"27","author":"Dwyer","year":"1981","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0027","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10878-008-9162-0","article-title":"A tighter formulation of the p-median problem","volume":"19","author":"Elloumi","year":"2010","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0028","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","article-title":"Covering problems in facility location: A review","volume":"62","author":"Farahani","year":"2012","journal-title":"Computers and Industrial Engineering"},{"issue":"6","key":"10.1016\/j.ejor.2023.04.044_bib0029","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","article-title":"A Lagrangean heuristic for the maximal covering location problem","volume":"88","author":"Galv\u00e3o","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0030","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s12532-015-0083-5","article-title":"Progress in presolving for mixed integer programming","volume":"7","author":"Gamrath","year":"2015","journal-title":"Mathematical Programming Computation"},{"key":"10.1016\/j.ejor.2023.04.044_bib0031","first-page":"99","article-title":"Covering location problems","author":"Garc\u00eda","year":"2019"},{"key":"10.1016\/j.ejor.2023.04.044_bib0032","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0033","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s13675-020-00129-6","article-title":"Two-row and two-column mixed-integer presolve using hashing-based pairing methods","volume":"8","author":"Gemander","year":"2020","journal-title":"European Journal on Computational Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0034","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.ejor.2020.06.028","article-title":"Large-scale influence maximization via maximal covering location","volume":"289","author":"G\u00fcney","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0035","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ejor.2015.09.006","article-title":"A mean-shift algorithm for large-scale planar maximal covering location problems","volume":"250","author":"He","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0036","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/s10601-012-9136-9","article-title":"Using dual presolving reductions to reformulate cumulative constraints","volume":"18","author":"Heinz","year":"2013","journal-title":"Constraints"},{"key":"10.1016\/j.ejor.2023.04.044_bib0037","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2015.01.006","article-title":"Demand point aggregation method for covering problems with gradual coverage","volume":"60","author":"Jang","year":"2015","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0038","doi-asserted-by":"crossref","first-page":"102264","DOI":"10.1016\/j.omega.2020.102264","article-title":"Benders decomposition for competitive influence maximization in (social) networks","volume":"100","author":"Kahr","year":"2021","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0039","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1016\/j.ejor.2021.03.015","article-title":"The minimal covering location and sizing problem in the presence of gradual cooperative coverage","volume":"295","author":"Karatas","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0040","series-title":"Complexity of computer computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0041","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","article-title":"MIPLIB 2010","volume":"3","author":"Koch","year":"2011","journal-title":"Mathematical Programming Computation"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0042","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1061\/(ASCE)0733-9372(1992)118:1(4)","article-title":"Optimal locations of monitoring stations in water distribution system","volume":"118","author":"Lee","year":"1992","journal-title":"Journal of Environmental Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0043","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2013.10.020","article-title":"An aggressive reduction scheme for the simple plant location problem","volume":"234","author":"Letchford","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2023.04.044_bib0044","first-page":"619","article-title":"Mixed integer programming computation","author":"Lodi","year":"2010"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0045","doi-asserted-by":"crossref","first-page":"197","DOI":"10.4236\/ajcm.2014.43016","article-title":"Variations of enclosing problem using axis parallel square(s): A general approach","volume":"4","author":"Mahapatra","year":"2014","journal-title":"American Journal of Computational Mathematics"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0046","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/0604028","article-title":"The maximum coverage location problem","volume":"4","author":"Megiddo","year":"1983","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0047","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.1467-9787.1982.tb00759.x","article-title":"The maximal covering location problem with facility placement on the entire plane","volume":"22","author":"Mehrez","year":"1982","journal-title":"Journal of Regional Science"},{"issue":"1","key":"10.1016\/j.ejor.2023.04.044_bib0048","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1177\/0160017615600222","article-title":"Maximal coverage location problem: Impacts, significance, and evolution","volume":"39","author":"Murray","year":"2016","journal-title":"International Regional Science Review"},{"issue":"7","key":"10.1016\/j.ejor.2023.04.044_bib0049","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1080\/13658810601169857","article-title":"Coverage optimization in continuous space facility siting","volume":"21","author":"Murray","year":"2007","journal-title":"International Journal of Geographical Information Science"},{"key":"10.1016\/j.ejor.2023.04.044_bib0050","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.cor.2016.08.018","article-title":"Intelligent-guided adaptive search for the maximum covering location problem","volume":"78","author":"M\u00e1ximo","year":"2017","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0051","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/ijoc.1050.0172","article-title":"Solution of large quadratic knapsack problems through aggressive reduction","volume":"19","author":"Pisinger","year":"2007","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2023.04.044_bib0052","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/ijoc.2013.0582","article-title":"Covering linear programming with violations","volume":"26","author":"Qiu","year":"2014","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2023.04.044_bib0053","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s10878-009-9264-3","article-title":"A branch and cut solver for the maximum stable set problem","volume":"21","author":"Rebennack","year":"2011","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0054","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.cor.2006.03.007","article-title":"Solving the maximal covering location problem with heuristic concentration","volume":"35","author":"ReVelle","year":"2008","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2023.04.044_bib0055","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1016\/j.cie.2011.12.026","article-title":"Location allocation modeling for healthcare facility planning in malaysia","volume":"62","author":"Shariff","year":"2012","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.ejor.2023.04.044_bib0056","first-page":"109","article-title":"Covering problems","author":"Snyder","year":"2011"},{"key":"10.1016\/j.ejor.2023.04.044_bib0057","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ejor.2020.09.029","article-title":"New exact algorithms for planar maximum covering location by ellipses problems","volume":"291","author":"Tedeschi","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2023.04.044_bib0058","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","article-title":"The location of emergency service facilities","volume":"19","author":"Toregas","year":"1971","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2023.04.044_bib0059","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/tgis.12608","article-title":"Challenges in applying capacitated covering models","volume":"24","author":"Xu","year":"2020","journal-title":"Transactions in GIS"},{"key":"10.1016\/j.ejor.2023.04.044_bib0060","series-title":"Challenging mathematical problems with elementary solutions","author":"Yaglom","year":"1987"},{"issue":"6","key":"10.1016\/j.ejor.2023.04.044_bib0061","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1016\/j.scient.2011.11.008","article-title":"The large scale maximal covering location problem","volume":"18","author":"Zarandi","year":"2011","journal-title":"Scientia Iranica"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221723003417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221723003417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T19:45:52Z","timestamp":1697139952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221723003417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["S0377221723003417"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2023.04.044","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient presolving methods for solving maximal covering and partial set covering location problems","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2023.04.044","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}