{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:06:17Z","timestamp":1775070377118,"version":"3.50.1"},"reference-count":53,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2024A1515010238"],"award-info":[{"award-number":["2024A1515010238"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["ZDCY20250901112210012"],"award-info":[{"award-number":["ZDCY20250901112210012"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.neucom.2026.133442","type":"journal-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T17:19:00Z","timestamp":1774545540000},"page":"133442","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A multi-objective evolutionary algorithm for constructing robust and influential networks"],"prefix":"10.1016","volume":"682","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9339-2276","authenticated-orcid":false,"given":"Junru","family":"Tang","sequence":"first","affiliation":[]},{"given":"Shuai","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.neucom.2026.133442_bib1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The Structure and Function of Complex Networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"issue":"6825","key":"10.1016\/j.neucom.2026.133442_bib2","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1038\/35065725","article-title":"Exploring complex networks","volume":"410","author":"Strogatz","year":"2001","journal-title":"Nature"},{"issue":"1","key":"10.1016\/j.neucom.2026.133442_bib3","doi-asserted-by":"crossref","first-page":"41600","DOI":"10.1038\/srep41600","article-title":"Constructing robust cooperative networks using a multi-objective evolutionary algorithm","volume":"7","author":"Wang","year":"2017","journal-title":"Sci. Rep."},{"key":"10.1016\/j.neucom.2026.133442_bib4","series-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"885","article-title":"Robust influence maximization","author":"He","year":"2016"},{"key":"10.1016\/j.neucom.2026.133442_bib5","series-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"795","article-title":"Robust influence maximization","author":"Chen","year":"2016"},{"key":"10.1016\/j.neucom.2026.133442_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2022.04.002","article-title":"Network resilience","volume":"971","author":"Liu","year":"2022","journal-title":"Phys. Rep."},{"issue":"4","key":"10.1016\/j.neucom.2026.133442_bib7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1093\/comnet\/cnv005","article-title":"Assortativity in complex networks","volume":"3","author":"Noldus","year":"2015","journal-title":"J. Complex Netw."},{"key":"10.1016\/j.neucom.2026.133442_bib8","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.ins.2016.12.027","article-title":"Clustering coefficients of large networks","volume":"382\u2013383","author":"Li","year":"2017","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.neucom.2026.133442_bib9","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"key":"10.1016\/j.neucom.2026.133442_bib10","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2019.106602","article-title":"Network approach for resilience evaluation of a UAV swarm by considering communication limits","volume":"193","author":"Bai","year":"2020","journal-title":"Reliab. Eng. & Syst. Saf."},{"issue":"3","key":"10.1016\/j.neucom.2026.133442_bib11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","article-title":"An efficient memetic algorithm for influence maximization in social networks","volume":"11","author":"Gong","year":"2016","journal-title":"IEEE Comput. Intell. Mag."},{"key":"10.1016\/j.neucom.2026.133442_bib12","series-title":"Proceedings of the 23rd International Conference on World Wide Web","first-page":"1157","article-title":"A fast approximation for influence maximization in large social networks","author":"Lee","year":"2014"},{"key":"10.1016\/j.neucom.2026.133442_bib13","article-title":"Power network robustness analysis based on electrical engineering and complex network theory","volume":"564","author":"Zhou","year":"2021","journal-title":"Physica A Statistical Mechanics Applications"},{"issue":"1","key":"10.1016\/j.neucom.2026.133442_bib14","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/TCSS.2022.3140779","article-title":"Modeling influencer marketing campaigns in social networks","volume":"10","author":"Doshi","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.neucom.2026.133442_bib15","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2022.112959","article-title":"Online public opinion dissemination model and simulation under media intervention from different perspectives","volume":"166","author":"Geng","year":"2023","journal-title":"Chaos Solitons & Fractals"},{"key":"10.1016\/j.neucom.2026.133442_bib16","series-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.neucom.2026.133442_bib17","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1109\/ACCESS.2017.2782814","article-title":"Influence maximization-cost minimization in social networks based on a multiobjective discrete particle swarm optimization algorithm","volume":"6","author":"Yang","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.neucom.2026.133442_bib18","series-title":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","first-page":"119","article-title":"A memetic algorithm to solve the robust influence maximization problems against cascading failures","author":"Cai","year":"2023"},{"key":"10.1016\/j.neucom.2026.133442_bib19","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.ins.2022.11.080","article-title":"A Memetic algorithm for determining robust and influential seeds against structural perturbances in competitive networks","volume":"621","author":"Wang","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.133442_bib20","article-title":"Inclusivity enhances robustness and efficiency of social networks","volume":"563","author":"Moore","year":"2021","journal-title":"Physica A Statistical Mechanics Applications"},{"key":"10.1016\/j.neucom.2026.133442_bib21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ins.2018.11.005","article-title":"Designing comprehensively robust networks against intentional attacks and cascading failures","volume":"478","author":"Wang","year":"2019","journal-title":"Inf. Sci."},{"issue":"1","key":"10.1016\/j.neucom.2026.133442_bib22","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/JSYST.2018.2835642","article-title":"Constructing robust community structure against edge-based attacks","volume":"13","author":"Wang","year":"2019","journal-title":"IEEE Syst. J."},{"issue":"6","key":"10.1016\/j.neucom.2026.133442_bib23","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.85.066130","article-title":"Enhancing network robustness against malicious attacks","volume":"85","author":"Zeng","year":"2012","journal-title":"Phys. Rev. E"},{"issue":"3","key":"10.1016\/j.neucom.2026.133442_bib24","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","article-title":"A fast algorithm for finding most influential people based on the linear threshold model","volume":"42","author":"Rahimkhani","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.133442_bib25","series-title":"Proceedings of the 20th international conference companion on World wide web","first-page":"47","article-title":"CELF++: optimizing the greedy algorithm for influence maximization in social networks","author":"Goyal","year":"2011"},{"key":"10.1016\/j.neucom.2026.133442_bib26","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.106942","article-title":"Efficient parallel computing on the game theory-aware robust influence maximization problem","volume":"220","author":"Gong","year":"2021","journal-title":"Knowl. -Based Syst."},{"key":"10.1016\/j.neucom.2026.133442_bib27","series-title":"Proceedings of the 2012 IEEE 12th International Conference on Data Mining","first-page":"468","article-title":"Robust influence maximization","author":"Lowalekar","year":"2012"},{"issue":"5","key":"10.1016\/j.neucom.2026.133442_bib28","first-page":"3536","article-title":"Robust submodular maximization: a non-uniform partitioning approach","volume":"64","author":"Bogunovic","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"10.1016\/j.neucom.2026.133442_bib29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3587100","article-title":"Robust influence maximization under both aleatory and epistemic uncertainty","volume":"17","author":"Biswas","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"5439","key":"10.1016\/j.neucom.2026.133442_bib30","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"10.1016\/j.neucom.2026.133442_bib31","article-title":"Power network robustness analysis based on electrical engineering and complex network theory","volume":"564","author":"Zhou","year":"2021","journal-title":"Physica A Statistical Mechanics Applications"},{"issue":"5","key":"10.1016\/j.neucom.2026.133442_bib32","doi-asserted-by":"crossref","first-page":"58003","DOI":"10.1209\/0295-5075\/101\/58003","article-title":"Maintain the structural controllability under malicious attacks on directed networks","volume":"101","author":"Wang","year":"2013","journal-title":"EPL"},{"issue":"10","key":"10.1016\/j.neucom.2026.133442_bib33","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1016\/j.ssci.2009.02.002","article-title":"Cascade-based attack vulnerability on the US power grid","volume":"47","author":"Wang","year":"2009","journal-title":"Saf. Sci."},{"issue":"1","key":"10.1016\/j.neucom.2026.133442_bib34","doi-asserted-by":"crossref","first-page":"6043","DOI":"10.1038\/s41467-020-19841-3","article-title":"Robustness and lethality in multilayer biological molecular networks","volume":"11","author":"Liu","year":"2020","journal-title":"Nat. Commun."},{"issue":"1","key":"10.1016\/j.neucom.2026.133442_bib35","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TCYB.2019.2931983","article-title":"Overlapping community detection in directed and undirected attributed networks using a multiobjective evolutionary algorithm","volume":"51","author":"Teng","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"10.1016\/j.neucom.2026.133442_bib36","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1016\/j.asoc.2011.10.005","article-title":"Multi-objective community detection in complex networks","volume":"12","author":"Shi","year":"2012","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"10.1016\/j.neucom.2026.133442_bib37","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1109\/TSMC.2018.2790438","article-title":"Network structural vulnerability: a multiobjective attacker perspective","volume":"49","author":"Faramondi","year":"2019","journal-title":"IEEE Trans. Syst. Man Cyber Syst."},{"issue":"2","key":"10.1016\/j.neucom.2026.133442_bib38","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.neucom.2026.133442_bib39","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TNSE.2017.2742522","article-title":"A multi-objective evolutionary algorithm for promoting the emergence of cooperation and controllable robustness on directed networks","volume":"5","author":"Wang","year":"2018","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"4","key":"10.1016\/j.neucom.2026.133442_bib40","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.66.046109","article-title":"Evolutionary reconstruction of networks","volume":"66","author":"Ipsen","year":"2002","journal-title":"Phys. Rev. E"},{"issue":"9","key":"10.1016\/j.neucom.2026.133442_bib41","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1016\/j.patcog.2008.03.011","article-title":"A study of graph spectra for comparing graphs and trees","volume":"41","author":"Wilson","year":"2008","journal-title":"Pattern Recognit."},{"issue":"1","key":"10.1016\/j.neucom.2026.133442_bib42","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"issue":"3","key":"10.1016\/j.neucom.2026.133442_bib43","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"issue":"1\u20137","key":"10.1016\/j.neucom.2026.133442_bib44","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual Web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"10.1016\/j.neucom.2026.133442_bib45","series-title":"The Structure and Dynamics of Networks","first-page":"38","article-title":"On the evolution of random graphs","author":"Erd\u00f6s","year":"2011"},{"issue":"6684","key":"10.1016\/j.neucom.2026.133442_bib46","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"issue":"6","key":"10.1016\/j.neucom.2026.133442_bib47","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: a multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.neucom.2026.133442_bib48","first-page":"1051","article-title":"MOPSO: a proposal for multiple objective particle swarm optimization","volume":"2","author":"Coello Coello","year":"2002"},{"issue":"12","key":"10.1016\/j.neucom.2026.133442_bib49","doi-asserted-by":"crossref","DOI":"10.1016\/j.heliyon.2024.e32911","article-title":"Many-objective ant lion optimizer (MaOALO): A new many-objective optimizer with its engineering applications","volume":"10","author":"Kalita","year":"2024","journal-title":"Heliyon"},{"issue":"6","key":"10.1016\/j.neucom.2026.133442_bib50","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","article-title":"A knee point-driven evolutionary algorithm for many-objective optimization","volume":"19","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.neucom.2026.133442_bib51","article-title":"The network data repository with interactive graph analytics and visualization","volume":"29","author":"Rossi","year":"2015"},{"key":"10.1016\/j.neucom.2026.133442_bib52","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.jpdc.2018.04.012","article-title":"A unified view of parallel multi-objective evolutionary algorithms","volume":"133","author":"Talbi","year":"2019","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"10.1016\/j.neucom.2026.133442_bib53","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1109\/TEVC.2019.2950935","article-title":"Surrogate-assisted robust optimization of large-scale networks based on graph embedding","volume":"24","author":"Wang","year":"2020","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226008398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226008398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:45Z","timestamp":1775066025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226008398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":53,"alternative-id":["S0925231226008398"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133442","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A multi-objective evolutionary algorithm for constructing robust and influential networks","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133442","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"133442"}}