{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T02:02:36Z","timestamp":1780020156165,"version":"3.53.1"},"reference-count":25,"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,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011789","name":"Jilin Provincial Science and Technology Department","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011789","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.knosys.2026.116140","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T15:33:13Z","timestamp":1778340793000},"page":"116140","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A large neighborhood search with deep optimization for the weighted total domination problem in massive graphs"],"prefix":"10.1016","volume":"346","author":[{"given":"Shuli","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dian","family":"Ling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaqi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziqing","family":"Liao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2915-8242","authenticated-orcid":false,"given":"Ruizhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6226-2394","authenticated-orcid":false,"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116140_b1","series-title":"Proceedings 2000 International Conference on Parallel Processing","first-page":"189","article-title":"Domination and its applications in ad hoc wireless networks with unidirectional links","author":"Wu","year":"2000"},{"key":"10.1016\/j.knosys.2026.116140_b2","series-title":"Proceedings of the 23rd International Conference on Computational Linguistics","first-page":"984","article-title":"Multi-document summarization via the minimum dominating set","author":"Shen","year":"2010"},{"issue":"3","key":"10.1016\/j.knosys.2026.116140_b3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.3390\/a14030079","article-title":"An improved greedy heuristic for the minimum positive influence dominating set problem in social networks","volume":"14","author":"Bouamama","year":"2021","journal-title":"Algorithms"},{"issue":"11","key":"10.1016\/j.knosys.2026.116140_b4","doi-asserted-by":"crossref","first-page":"2127","DOI":"10.1109\/JSAC.2006.881606","article-title":"Gateway placement optimization in wireless mesh networks with QoS constraints","volume":"24","author":"Aoun","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"12","key":"10.1016\/j.knosys.2026.116140_b5","first-page":"1164","article-title":"Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks","volume":"12","author":"Balaji","year":"2013","journal-title":"WSEAS Trans. Math."},{"issue":"7","key":"10.1016\/j.knosys.2026.116140_b6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ipl.2014.02.002","article-title":"Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs","volume":"114","author":"Belhoul","year":"2014","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.knosys.2026.116140_b7","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","article-title":"On the algorithmic complexity of total domination","volume":"5","author":"Laskar","year":"1984","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"10.1016\/j.knosys.2026.116140_b8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.amc.2019.04.038","article-title":"Integer linear programming models for the weighted total domination problem","volume":"358","author":"Ma","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.knosys.2026.116140_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105157","article-title":"Exact and heuristic algorithms for the weighted total domination problem","volume":"127","author":"\u00c1lvarez-Miranda","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2026.116140_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110387","article-title":"Variable neighborhood search for weighted total domination problem and its application in social network information spreading","volume":"143","author":"Kapunac","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.knosys.2026.116140_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120364","article-title":"A knowledge-based iterated local search for the weighted total domination problem","volume":"665","author":"Sun","year":"2024","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.116140_b12","series-title":"Metaheuristics","first-page":"377","article-title":"Improving biased random key genetic algorithm with variable neighborhood search for the weighted total domination problem","volume":"vol. 14953","author":"Casado","year":"2024"},{"key":"10.1016\/j.knosys.2026.116140_b13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11750-025-00695-1","article-title":"Heuristics for the weighted total domination problem","volume":"33","author":"Casado","year":"2025","journal-title":"TOP"},{"key":"10.1016\/j.knosys.2026.116140_b14","series-title":"Graph Neural Networks Meet Local Search for the Weighted Total Domination Problem","author":"Simunics","year":"2024"},{"key":"10.1016\/j.knosys.2026.116140_b15","series-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence","first-page":"1514","article-title":"A fast local search algorithm for the minimum weight dominating set problem on massive graphs","author":"Wang","year":"2018"},{"key":"10.1016\/j.knosys.2026.116140_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","article-title":"GLNS: An effective large neighborhood search heuristic for the generalized traveling salesman problem","volume":"87","author":"Smith","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2026.116140_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103786","article-title":"Neural large neighborhood search for routing problems","volume":"313","author":"Hottung","year":"2022","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/j.knosys.2026.116140_b18","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp. Sci."},{"issue":"9\u201310","key":"10.1016\/j.knosys.2026.116140_b19","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","article-title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","volume":"175","author":"Cai","year":"2011","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.knosys.2026.116140_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2019.103230","article-title":"SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem","volume":"280","author":"Wang","year":"2020","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.knosys.2026.116140_b21","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"12258","article-title":"NuQClq: An effective local search algorithm for maximum quasi-clique problem","volume":"vol. 35","author":"Chen","year":"2021"},{"key":"10.1016\/j.knosys.2026.116140_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103819","article-title":"Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism","volume":"314","author":"Chen","year":"2023","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.knosys.2026.116140_b23","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1613\/jair.5443","article-title":"Finding a small vertex cover in massive sparse graphs: Construct, local search, and preprocess","volume":"59","author":"Cai","year":"2017","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.knosys.2026.116140_b24","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.knosys.2026.116140_b25","series-title":"SNAP datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095070512600866X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095070512600866X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T01:14:14Z","timestamp":1780017254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095070512600866X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":25,"alternative-id":["S095070512600866X"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116140","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A large neighborhood search with deep optimization for the weighted total domination problem in massive graphs","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116140","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":"116140"}}