{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:25:26Z","timestamp":1783059926163,"version":"3.54.6"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQN26F020073"],"award-info":[{"award-number":["LQN26F020073"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008045","name":"Nanjing University of Information Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008045","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62506109"],"award-info":[{"award-number":["62506109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306149"],"award-info":[{"award-number":["62306149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013156","name":"Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology","doi-asserted-by":"publisher","award":["2023r045"],"award-info":[{"award-number":["2023r045"]}],"id":[{"id":"10.13039\/501100013156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.eswa.2026.132943","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T21:27:27Z","timestamp":1779830847000},"page":"132943","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An observer-enhanced evolutionary search framework for solving the simplified diversified top-k s-plex problem"],"prefix":"10.1016","volume":"328","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5065-2558","authenticated-orcid":false,"given":"Jiejiang","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuping","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5239-5126","authenticated-orcid":false,"given":"Jun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiguo","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2026.132943_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122835","article-title":"Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups","volume":"242","author":"Adouani","year":"2024","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0002","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","article-title":"Clique relaxations in social network analysis: The maximum k-plex problem","volume":"59","author":"Balasundaram","year":"2011","journal-title":"Operations Research"},{"issue":"11","key":"10.1016\/j.eswa.2026.132943_bib0003","doi-asserted-by":"crossref","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","article-title":"Mining market data: A network approach","volume":"33","author":"Boginski","year":"2006","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3639318","article-title":"Maximum k-plex computation: Theory and practice","volume":"2","author":"Chang","year":"2024","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"10.1016\/j.eswa.2026.132943_bib0005","series-title":"Proceedings of the 23rd ACM SIGKDD International conference on knowledge discovery and data mining","first-page":"115","article-title":"Fast enumeration of large k-plexes","author":"Conte","year":"2017"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0006","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/s10878-020-00664-3","article-title":"Top-k overlapping densest subgraphs: Approximation algorithms and computational complexity","volume":"41","author":"Dondi","year":"2021","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"10.1016\/j.eswa.2026.132943_bib0007","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.1070.0211","article-title":"Modelling robust flight-gate scheduling as a clique partitioning problem","volume":"42","author":"Dorndorf","year":"2008","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0008","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1109\/18.651069","article-title":"Greedy and heuristic algorithms for codes and colorings","volume":"44","author":"Etzion","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"issue":"13","key":"10.1016\/j.eswa.2026.132943_bib0009","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.14778\/2536258.2536263","article-title":"Diversified top-k graph pattern matching","volume":"6","author":"Fan","year":"2013","journal-title":"Proceedings of the VLDB Endowment (PVLDB)"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0010","doi-asserted-by":"crossref","DOI":"10.1080\/21642583.2024.2314481","article-title":"A cooperative stochastic configuration network based on differential evolutionary sparrow search algorithm for prediction","volume":"12","author":"Fang","year":"2024","journal-title":"Systems Science & Control Engineering"},{"issue":"200","key":"10.1016\/j.eswa.2026.132943_bib0011","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","article-title":"The use of ranks to avoid the assumption of normality implicit in the analysis of variance","volume":"32","author":"Friedman","year":"1937","journal-title":"Journal of the American Statistical Association"},{"issue":"4","key":"10.1016\/j.eswa.2026.132943_bib0012","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TKDE.2011.117","article-title":"Holistic top-k simple shortest path join in graphs","volume":"24","author":"Gao","year":"2011","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.eswa.2026.132943_bib0013","unstructured":"Gao, S., Yu, K., Liu, S., & Long, C. (2024). Maximum k-plex search: An alternated reduction-and-bound method. arXiv preprint arXiv: 2406.00617,."},{"issue":"12","key":"10.1016\/j.eswa.2026.132943_bib0014","first-page":"2677","article-title":"An extension on\u201d statistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons","volume":"9","author":"Garcia","year":"2008","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"10.1016\/j.eswa.2026.132943_bib0015","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1631\/FITEE.1800133","article-title":"Efficient keyword search over graph-structured data based on minimal covered r-cliques","volume":"21","author":"Ghanbarpour","year":"2020","journal-title":"Frontiers of Information Technology & Electronic Engineering"},{"key":"10.1016\/j.eswa.2026.132943_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.iswa.2023.200242","article-title":"A new local search for the bees algorithm to optimize multiple traveling salesman problem","volume":"18","author":"Hamza","year":"2023","journal-title":"Intelligent Systems with Applications"},{"key":"10.1016\/j.eswa.2026.132943_bib0017","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.future.2020.02.023","article-title":"Diversified top-k maximal clique detection in social internet of things","volume":"107","author":"Hao","year":"2020","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/j.eswa.2026.132943_bib0018","series-title":"Proceedings of 37th Conference on foundations of computer science","first-page":"627","article-title":"Clique is hard to approximate within n\/sup 1-\/spl epsiv","author":"Hastad","year":"1996"},{"key":"10.1016\/j.eswa.2026.132943_bib0019","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123915","article-title":"Ccss: Towards conductance-based community search with size constraints","volume":"250","author":"He","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.132943_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126229","article-title":"Dual-stage dual-population diversity maintenance for global and local exploration of constrained multiobjective optimization","volume":"268","author":"He","year":"2025","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.132943_bib0021","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Operations Research Perspectives"},{"issue":"6","key":"10.1016\/j.eswa.2026.132943_bib0022","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1007\/s00778-021-00681-6","article-title":"Maximum and top-k diversified biclique search at scale","volume":"31","author":"Lyu","year":"2022","journal-title":"The VLDB Journal"},{"key":"10.1016\/j.eswa.2026.132943_bib0023","series-title":"Tencon 2023-2023 IEEE Region 10 conference (tencon)","first-page":"674","article-title":"Solving dense subgraph problems using genetic algorithm","author":"Pachuau","year":"2023"},{"key":"10.1016\/j.eswa.2026.132943_bib0024","series-title":"Handbook of approximation algorithms and metaheuristics","first-page":"411","article-title":"Stochastic local search algorithms for multiobjective combinatorial optimization: A review","author":"Paquete","year":"2018"},{"issue":"3","key":"10.1016\/j.eswa.2026.132943_bib0025","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-020-09459-5","article-title":"Local search for the maximum k-plex problem","volume":"27","author":"Pullan","year":"2021","journal-title":"Journal of Heuristics"},{"issue":"10","key":"10.1016\/j.eswa.2026.132943_bib0026","doi-asserted-by":"crossref","first-page":"2172","DOI":"10.1080\/00207721.2024.2337039","article-title":"Differential evolution with adaptive niching and reinitialisation for nonlinear equation systems","volume":"55","author":"Sheng","year":"2024","journal-title":"International Journal of Systems Science"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0027","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/00207721.2023.2268244","article-title":"Observer-based adaptive controllers for lur\u2019e multi-agent systems with a dynamic leader","volume":"55","author":"Song","year":"2024","journal-title":"International Journal of Systems Science"},{"issue":"3","key":"10.1016\/j.eswa.2026.132943_bib0028","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.1040.0189","article-title":"Optimal protein structure alignment using maximum cliques","volume":"53","author":"Strickland","year":"2005","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.132943_bib0029","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1525\/ae.1997.24.1.219","article-title":"Social network analysis: Methods and applications","volume":"24","author":"Wolfe","year":"1997","journal-title":"American Ethnologist"},{"key":"10.1016\/j.eswa.2026.132943_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106187","article-title":"On solving simplified diversified top-k s-plex problem","volume":"153","author":"Wu","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.132943_bib0031","series-title":"IJCAI","first-page":"4821","article-title":"Hea-d: A hybrid evolutionary algorithm for diversified top-k weight clique search problem","author":"Wu","year":"2022"},{"key":"10.1016\/j.eswa.2026.132943_bib0032","series-title":"Proceedings of the AAAI Conference on artificial intelligence","first-page":"15929","article-title":"Local search for diversified top-k s-plex search problem (student abstract)","volume":"vol. 35","author":"Wu","year":"2021"},{"issue":"6","key":"10.1016\/j.eswa.2026.132943_bib0033","first-page":"1","article-title":"An efficient and exact algorithm for locally h-clique densest subgraph discovery","volume":"2","author":"Xu","year":"2024","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"10.1016\/j.eswa.2026.132943_bib0034","series-title":"ECAI 2024","first-page":"4108","article-title":"DiverTEAM: An effective evolutionary algorithm for diversified top-k (weight) clique search problems","volume":"vol. 392","author":"Xue","year":"2024"},{"key":"10.1016\/j.eswa.2026.132943_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113340","article-title":"A multimodal multiobjective evolutionary algorithm based on neighborhood and enhanced special crowding distance","volume":"315","author":"Yue","year":"2025","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.eswa.2026.132943_bib0036","unstructured":"Zheng, J., Xue, J., He, K., Li, C.-M., & Liu, Y. (2024). An efficient evolutionary algorithm for diversified top-k (weight) clique search problems. arXiv preprint arXiv: 2404.09997,."},{"key":"10.1016\/j.eswa.2026.132943_bib0037","unstructured":"Zheng, Z., Xie, Z., Wang, Z., & Hooi, B. (2025). Monte carlo tree search for comprehensive exploration in llm-based automatic heuristic design. arXiv preprint arXiv: 2501.08603,."},{"key":"10.1016\/j.eswa.2026.132943_bib0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.128723","article-title":"Gpo++: A dynamic pooling routing network based on pooling operator for cross-modal retrieval","author":"Zhong","year":"2025","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.132943_bib0039","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.ins.2019.10.076","article-title":"Community detection based on modularity and k-plexes","volume":"513","author":"Zhu","year":"2020","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2026.132943_bib0040","series-title":"2010\u202fIEEE 26th International conference on data engineering (ICDE 2010)","first-page":"649","article-title":"Finding top-k maximal cliques in an uncertain graph","author":"Zou","year":"2010"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426018555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426018555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:05:39Z","timestamp":1783058739000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426018555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":40,"alternative-id":["S0957417426018555"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132943","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An observer-enhanced evolutionary search framework for solving the simplified diversified top-k s-plex problem","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132943","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"132943"}}