{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:13:12Z","timestamp":1769163192883,"version":"3.49.0"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002850","name":"CONICYT FONDECYT","doi-asserted-by":"publisher","award":["11200113"],"award-info":[{"award-number":["11200113"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"CONICYT FONDECYT","doi-asserted-by":"publisher","award":["11231016"],"award-info":[{"award-number":["11231016"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020884","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":[[2024,3]]},"DOI":"10.1016\/j.asoc.2024.111343","type":"journal-article","created":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T20:13:38Z","timestamp":1706818418000},"page":"111343","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["On the max\u2013min influence spread problem: A multi-objective optimization approach"],"prefix":"10.1016","volume":"154","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4491-0148","authenticated-orcid":false,"given":"Fabi\u00e1n","family":"Riquelme","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Mu\u00f1oz","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Olivares","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2024.111343_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118770","article-title":"Influence maximization in social networks using transfer learning via graph-based LSTM","volume":"212","author":"Kumar","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2024.111343_b2","series-title":"Social Network Data Analytics","first-page":"177","article-title":"A survey of models and algorithms for social influence analysis","author":"Sun","year":"2011"},{"key":"10.1016\/j.asoc.2024.111343_b3","series-title":"Information and Influence Propagation in Social Networks","author":"Chen","year":"2014"},{"key":"10.1016\/j.asoc.2024.111343_b4","series-title":"Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 26-29, 2001","first-page":"57","article-title":"Mining the network value of customers","author":"Domingos","year":"2001"},{"key":"10.1016\/j.asoc.2024.111343_b5","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD\u201903","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"issue":"3","key":"10.1016\/j.asoc.2024.111343_b6","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.ejor.2014.11.006","article-title":"Cooperation through social influence","volume":"242","author":"Molinero","year":"2015","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.asoc.2024.111343_b7","series-title":"2011 IEEE 11th International Conference on Data Mining","first-page":"427","article-title":"Minimizing seed set for viral marketing","author":"Long","year":"2011"},{"issue":"10","key":"10.1016\/j.asoc.2024.111343_b8","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","article-title":"Influence maximization on social graphs: A survey","volume":"30","author":"Li","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.asoc.2024.111343_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106623","article-title":"A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods","volume":"212","author":"Olivares","year":"2021","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"10.1016\/j.asoc.2024.111343_b10","doi-asserted-by":"crossref","first-page":"14465","DOI":"10.1016\/j.ifacol.2017.08.2293","article-title":"Minimizing the influence propagation in social networks for linear threshold models","volume":"50","author":"Yang","year":"2017","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.asoc.2024.111343_b11","series-title":"2013 IEEE 13th International Conference on Data Mining","first-page":"567","article-title":"Least cost influence in multiplex social networks: Model representation and analysis","author":"Nguyen","year":"2013"},{"issue":"3","key":"10.1016\/j.asoc.2024.111343_b12","doi-asserted-by":"crossref","first-page":"6305","DOI":"10.32604\/cmc.2022.021804","article-title":"Extremal coalitions for influence games through swarm intelligence-based methods","volume":"70","author":"Riquelme","year":"2022","journal-title":"Comput., Mater. Continua"},{"key":"10.1016\/j.asoc.2024.111343_b13","series-title":"Applications of Evolutionary Computation","first-page":"221","article-title":"Multi-objective evolutionary algorithms for influence maximization in social networks","author":"Bucur","year":"2017"},{"key":"10.1016\/j.asoc.2024.111343_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.array.2022.100264","article-title":"Influence maximization in social networks: Theories, methods and challenges","volume":"16","author":"Ye","year":"2022","journal-title":"Array"},{"key":"10.1016\/j.asoc.2024.111343_b15","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.knosys.2017.10.029","article-title":"Centrality measure in social networks based on linear threshold model","volume":"140","author":"Riquelme","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.asoc.2024.111343_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.121430","article-title":"The neighborhood role in the linear threshold rank on social networks","volume":"528","author":"Riquelme","year":"2019","journal-title":"Physica A"},{"key":"10.1016\/j.asoc.2024.111343_b17","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-981-15-0111-1_18","article-title":"A centrality measure for influence maximization across multiple social networks","author":"Singh","year":"2019"},{"key":"10.1016\/j.asoc.2024.111343_b18","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.automatica.2018.10.053","article-title":"Influence minimization in linear threshold networks","volume":"100","author":"Yang","year":"2019","journal-title":"Automatica"},{"key":"10.1016\/j.asoc.2024.111343_b19","series-title":"Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","first-page":"479","article-title":"Social influence under improved multi-objective metaheuristics","author":"Riquelme","year":"2021"},{"issue":"8","key":"10.1016\/j.asoc.2024.111343_b20","doi-asserted-by":"crossref","first-page":"1790","DOI":"10.3390\/electronics12081790","article-title":"A multi-objective crow search algorithm for influence maximization in social networks","volume":"12","author":"Wang","year":"2023","journal-title":"Electronics"},{"key":"10.1016\/j.asoc.2024.111343_b21","series-title":"2023 17th International Conference on Ubiquitous Information Management and Communication","first-page":"1","article-title":"Multi-objective information maximization in a social network","author":"Kandhway","year":"2023"},{"key":"10.1016\/j.asoc.2024.111343_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119138","article-title":"Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge","volume":"214","author":"Gong","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2024.111343_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.jocs.2023.101955","article-title":"Identification of influential users with cost minimization via an improved moth flame optimization","volume":"67","author":"Wang","year":"2023","journal-title":"J. Comput. Sci."},{"issue":"27","key":"10.1016\/j.asoc.2024.111343_b24","doi-asserted-by":"crossref","first-page":"322","DOI":"10.3182\/20130925-2-DE-4044.00006","article-title":"On the spread of innovation in social networks","volume":"46","author":"Rosa","year":"2013","journal-title":"IFAC Proc. Vol."},{"key":"10.1016\/j.asoc.2024.111343_b25","doi-asserted-by":"crossref","first-page":"149529","DOI":"10.1109\/ACCESS.2021.3123892","article-title":"Contagion modeling and simulation in transport and air travel networks during the COVID-19 pandemic: A survey","volume":"9","author":"Riquelme","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.asoc.2024.111343_b26","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.physa.2019.03.008","article-title":"Viral marketing on social networks: An epidemiological perspective","volume":"525","author":"Bhattacharya","year":"2019","journal-title":"Physica A"},{"issue":"7","key":"10.1016\/j.asoc.2024.111343_b27","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1007\/s00787-021-01856-w","article-title":"The impact of COVID-19 lockdown on child and adolescent mental health: systematic review","volume":"32","author":"Panchal","year":"2021","journal-title":"Eur. Child Adolesc. Psychiatry"},{"issue":"5","key":"10.1016\/j.asoc.2024.111343_b28","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0270-0255(82)90038-0","article-title":"A mathematical basis for satisficing decision making","volume":"3","author":"Wierzbicki","year":"1982","journal-title":"Math. Model."},{"key":"10.1016\/j.asoc.2024.111343_b29","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","article-title":"Influence maximization in social networks based on discrete particle swarm optimization","volume":"367\u2013368","author":"Gong","year":"2016","journal-title":"Inform. Sci."},{"key":"10.1016\/j.asoc.2024.111343_b30","series-title":"MHS\u201995. Proceedings of the Sixth International Symposium on Micro Machine and Human Science","first-page":"39","article-title":"A new optimizer using particle swarm theory","author":"Eberhart","year":"1995"},{"key":"10.1016\/j.asoc.2024.111343_b31","series-title":"Swarm Intelligence Algorithms for Multi-Objective Max-Min-ISP","author":"Mu\u00f1oz","year":"2023"},{"key":"10.1016\/j.asoc.2024.111343_b32","series-title":"SNAP Datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"10.1016\/j.asoc.2024.111343_b33","series-title":"Swarm Intelligence Algorithms for Multi-Objective IMP: Step-by-Step Improvement","author":"Mu\u00f1oz","year":"2022"},{"key":"10.1016\/j.asoc.2024.111343_b34","series-title":"2016 IEEE 16th International Conference on Data Mining","first-page":"221","article-title":"Edge weight prediction in weighted signed networks","author":"Kumar","year":"2016"},{"key":"10.1016\/j.asoc.2024.111343_b35","series-title":"Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining - WSDM\u201918","first-page":"333","article-title":"REV2","author":"Kumar","year":"2018"},{"issue":"1","key":"10.1016\/j.asoc.2024.111343_b36","doi-asserted-by":"crossref","DOI":"10.1038\/srep02980","article-title":"The anatomy of a scientific rumor","volume":"3","author":"Domenico","year":"2013","journal-title":"Sci. Rep."},{"key":"10.1016\/j.asoc.2024.111343_b37","series-title":"Ambient Intelligence - Software and Applications","first-page":"23","article-title":"Power indices of influence games and new centrality measures for agent societies and social networks","author":"Molinero","year":"2014"},{"key":"10.1016\/j.asoc.2024.111343_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100718","article-title":"Population size in particle swarm optimization","volume":"58","author":"Piotrowski","year":"2020","journal-title":"Swarm Evol. Comput."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624001170?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624001170?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:33:09Z","timestamp":1761597189000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494624001170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":38,"alternative-id":["S1568494624001170"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2024.111343","relation":{"is-supplemented-by":[{"id-type":"doi","id":"10.24433\/CO.2029716.v1","asserted-by":"subject"}]},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the max\u2013min influence spread problem: A multi-objective optimization approach","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2024.111343","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"111343"}}