{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:44:03Z","timestamp":1776876243556,"version":"3.51.2"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:00:00Z","timestamp":1775692800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["PID2021-125709OA-C22"],"award-info":[{"award-number":["PID2021-125709OA-C22"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Asuntos Econ\u00f3micos y Transformaci\u00f3n Digital, Gobierno de Espa\u00f1a","doi-asserted-by":"publisher","award":["TSI-100930-2023-3"],"award-info":[{"award-number":["TSI-100930-2023-3"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Community of Madrid","doi-asserted-by":"publisher","award":["TEC-2024\/COM-404"],"award-info":[{"award-number":["TEC-2024\/COM-404"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.asoc.2026.115201","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T17:34:28Z","timestamp":1775842468000},"page":"115201","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A scalable GRASP algorithm for the targeted misinformation blocking problem"],"prefix":"10.1016","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8156-9999","authenticated-orcid":false,"given":"Iv\u00e1n","family":"Penedo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2608-8464","authenticated-orcid":false,"given":"Isaac","family":"Lozano-Osorio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.asoc.2026.115201_bib0005","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1007\/s10878-019-00439-5","article-title":"Minimum budget for misinformation blocking in online social networks","volume":"38","author":"Pham","year":"2019","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.asoc.2026.115201_bib0010","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1257\/jep.31.2.211","article-title":"Social media and fake news in the 2016 election","volume":"31","author":"Allcott","year":"2017","journal-title":"J. Econ. Perspect."},{"issue":"10","key":"10.1016\/j.asoc.2026.115201_bib0015","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1016\/j.comnet.2013.04.002","article-title":"Analysis of misinformation containment in online social networks","volume":"57","author":"Nguyen","year":"2013","journal-title":"Comput. Netw."},{"key":"10.1016\/j.asoc.2026.115201_bib0020","series-title":"Proceedings of the 20th International Conference on World Wide Web","first-page":"665","article-title":"Limiting the spread of misinformation in social networks","author":"Budak","year":"2011"},{"key":"10.1016\/j.asoc.2026.115201_bib0025","series-title":"Machine Learning and Knowledge Discovery in Databases","first-page":"99","article-title":"Virus propagation on time-varying networks: theory and immunization algorithms","author":"Prakash","year":"2010"},{"key":"10.1016\/j.asoc.2026.115201_bib0030","series-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1226","article-title":"Scalable diffusion-aware optimization of network topology","author":"Khalil","year":"2014"},{"issue":"3","key":"10.1016\/j.asoc.2026.115201_bib0035","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2885494","article-title":"Misinformation in online social networks: detect them all with a limited budget","volume":"34","author":"Zhang","year":"2016","journal-title":"ACM Trans. Inf. Syst."},{"issue":"3","key":"10.1016\/j.asoc.2026.115201_bib0040","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.22134","article-title":"Variable neighborhood search approach with intensified shake for monitor placement","volume":"81","author":"Casado","year":"2023","journal-title":"Networks"},{"key":"10.1016\/j.asoc.2026.115201_bib0045","series-title":"52nd IEEE Conference on Decision and Control","first-page":"7486","article-title":"Optimal vaccine allocation to control epidemic outbreaks in arbitrary networks","author":"Preciado","year":"2013"},{"issue":"2","key":"10.1016\/j.asoc.2026.115201_bib0050","first-page":"1","article-title":"Data-aware vaccine allocation over large networks","volume":"10","author":"Zhang","year":"2015","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.asoc.2026.115201_bib0055","doi-asserted-by":"crossref","first-page":"13745","DOI":"10.1109\/ACCESS.2019.2894073","article-title":"Influence maximization in independent cascade networks based on activation probability computation","volume":"7","author":"Yang","year":"2019","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.asoc.2026.115201_bib0060","doi-asserted-by":"crossref","first-page":"3767","DOI":"10.1007\/s12652-021-03510-4","article-title":"A quick grasp-based method for influence maximization in social networks","volume":"14","author":"Lozano-Osorio","year":"2021","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2026.115201_bib0065","doi-asserted-by":"crossref","DOI":"10.1007\/s13278-024-01336-4","article-title":"A variable neighborhood search approach for the adaptive multi round influence maximization problem","volume":"14","author":"Lozano-Osorio","year":"2024","journal-title":"Soc. Netw. Anal. Min."},{"issue":"3","key":"10.1016\/j.asoc.2026.115201_bib0070","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","article-title":"Scalable influence maximization for independent cascade model in large-scale social networks","volume":"25","author":"Wang","year":"2012","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.asoc.2026.115201_bib0075","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.procs.2020.06.037","article-title":"Efficient influence maximization in social-networks under independent cascade model","volume":"173","author":"Trivedi","year":"2020","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.asoc.2026.115201_bib0080","series-title":"Proceedings of the 2012 SIAM International Conference on Data Mining","first-page":"463","article-title":"Influence blocking maximization in social networks under the competitive linear threshold model","author":"He","year":"2012"},{"key":"10.1016\/j.asoc.2026.115201_bib0085","series-title":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","first-page":"1","article-title":"An efficient randomized algorithm for rumor blocking in online social networks","author":"Tong","year":"2017"},{"key":"10.1016\/j.asoc.2026.115201_bib0090","series-title":"Advances in Neural Information Processing Systems","first-page":"339","article-title":"On misinformation containment in online social networks","volume":"vol. 31","author":"Tong","year":"2018"},{"issue":"4","key":"10.1016\/j.asoc.2026.115201_bib0095","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1007\/s10878-018-0252-3","article-title":"Maximizing misinformation restriction within time and budget constraints","volume":"35","author":"Pham","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.asoc.2026.115201_bib0100","series-title":"Proceedings of the Eighth International Symposium on Information and Communication Technology","first-page":"262","article-title":"Limiting the spread of epidemics within time constraint on online social networks","author":"Pham","year":"2017"},{"issue":"7","key":"10.1016\/j.asoc.2026.115201_bib0105","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1109\/TKDE.2019.2904969","article-title":"Blocking self-avoiding walks stops cyber-epidemics: a scalable gpu-based approach","volume":"32","author":"Nguyen","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.asoc.2026.115201_bib0110","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"10.1016\/j.asoc.2026.115201_bib0115","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","article-title":"A greedy randomized adaptive search procedure for maximum independent set","volume":"42","author":"Feo","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2026.115201_bib0120","author":"Leskovec"},{"key":"10.1016\/j.asoc.2026.115201_bib0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110827","article-title":"Dynamic path relinking for the target set selection problem","volume":"278","author":"Lozano-Osorio","year":"2023","journal-title":"Knowl.-based Syst."},{"issue":"1","key":"10.1016\/j.asoc.2026.115201_bib0130","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10732-022-09490-8","article-title":"A grasp algorithm with tabu search improvement for solving the maximum intersection of k-subsets problem","volume":"28","author":"Casado","year":"2022","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.asoc.2026.115201_bib0135","doi-asserted-by":"crossref","first-page":"3197","DOI":"10.1007\/s40747-023-01316-9","article-title":"A communication-based identification of critical drones in malicious drone swarm networks","volume":"10","author":"Teng","year":"2024","journal-title":"Complex Intell. Syst."},{"key":"10.1016\/j.asoc.2026.115201_bib0140","doi-asserted-by":"crossref","first-page":"116102","DOI":"10.1016\/j.chaos.2025.116102","article-title":"A dynamic station-line centrality for identifying critical stations in bus-metro networks","volume":"194","author":"Li","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.asoc.2026.115201_bib0145","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.cor.2019.06.011","article-title":"Optimizing node infiltrations in complex networks by a local search based heuristic","volume":"111","author":"Lozano","year":"2019","journal-title":"Comput. Oper. Res."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626006496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626006496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:58:56Z","timestamp":1776873536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626006496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":29,"alternative-id":["S1568494626006496"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115201","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A scalable GRASP algorithm for the targeted misinformation blocking problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115201","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115201"}}