{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:06:12Z","timestamp":1778861172103,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T00:00:00Z","timestamp":1484092800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502464"],"award-info":[{"award-number":["61502464"]}],"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":["61503074"],"award-info":[{"award-number":["61503074"]}],"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":["61370156"],"award-info":[{"award-number":["61370156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for New Century Excellent Talents in University (CN)","award":["NCET-13-0724"],"award-info":[{"award-number":["NCET-13-0724"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00521-016-2813-7","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T07:20:10Z","timestamp":1484119210000},"page":"2519-2529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A memetic algorithm for minimum independent dominating set problem"],"prefix":"10.1007","volume":"30","author":[{"given":"Yiyuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiejiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanyao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"2813_CR1","volume-title":"Computers and intractability: a guide to theory of NP-completeness","author":"RG Michael","year":"1979","unstructured":"Michael RG, David SJ (1979) Computers and intractability: a guide to theory of NP-completeness. WH Freeman, San Francisco"},{"issue":"7","key":"2813_CR2","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/49.622910","volume":"15","author":"CR Lin","year":"1997","unstructured":"Lin CR, Gerla M (1997) Adaptive clustering for mobile wireless network. IEEE J Sel Areas Commun 15(7):1265\u20131275","journal-title":"IEEE J Sel Areas Commun"},{"issue":"1\u20134","key":"2813_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1023447105713","volume":"22","author":"FG Nocetti","year":"2003","unstructured":"Nocetti FG, Gonzalez JS, Stojmenovic I (2003) Connectivity based k-hop clustering in wireless networks. Telecommun Syst 22(1\u20134):205\u2013220","journal-title":"Telecommun Syst"},{"issue":"2","key":"2813_CR4","first-page":"162","volume":"6","author":"K Erciyes","year":"2007","unstructured":"Erciyes K, Dagdeviren O, Cokuslu D et al (2007) Graph theoretic clustering algorithm in mobile ad hoc networks and wireless sensor networks. Appl Comput Math 6(2):162\u2013180","journal-title":"Appl Comput Math"},{"key":"2813_CR5","first-page":"1","volume":"28","author":"Y Chen","year":"2004","unstructured":"Chen Y, Liestman A, Liu J (2004) Clustering algorithms for ad hoc wireless networks. Ad Hoc Sens Netw 28:1\u201316","journal-title":"Ad Hoc Sens Netw"},{"issue":"1","key":"2813_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s11277-014-1748-5","volume":"78","author":"Shengdong Xie","year":"2014","unstructured":"Xie Shengdong, Wang YuXiang (2014) Construction of Tree network with limited delivery latency in homogeneous wireless sensor networks. Wirel Pers Commun 78(1):231\u2013246","journal-title":"Wirel Pers Commun"},{"issue":"6","key":"2813_CR7","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.jpdc.2009.02.004","volume":"69","author":"K Akkaya","year":"2009","unstructured":"Akkaya K, Senel F, McLaughlan B (2009) Clustering of wireless sensor and actor networks based on sensor distribution and connectivity. J Parallel Distrib Comput 69(6):573\u2013587","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"2813_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"MM Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson MM (1993) Approximating the minimum maximal independence number. Inf Process Lett 46(4):169\u2013172","journal-title":"Inf Process Lett"},{"issue":"3","key":"2813_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1998","unstructured":"Johnson DS, Yannakakis M, Papadimitriou CH (1998) On generating all maximal independent sets. Inf Process Lett 27(3):119\u2013123","journal-title":"Inf Process Lett"},{"issue":"1","key":"2813_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon JW, Moser L (1965) On cliques in graphs. Israel J Math 3(1):23\u201328","journal-title":"Israel J Math"},{"key":"2813_CR11","first-page":"78","volume-title":"A branch-and-reduce algorithm for finding a minimum independent dominating set in graph. Graph-theoretic concepts in computer science","author":"S Gaspers","year":"2006","unstructured":"Gaspers S, Liedloff M (2006) A branch-and-reduce algorithm for finding a minimum independent dominating set in graph. Graph-theoretic concepts in computer science. Springer, Berlin, pp 78\u201389"},{"issue":"4","key":"2813_CR12","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois N, Della Croce F, Escoffier B et al (2013) Fast algorithm for min independent dominating set. Discrete Appl Math 161(4):558\u2013572","journal-title":"Discrete Appl Math"},{"key":"2813_CR13","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"SW Cai","year":"2013","unstructured":"Cai SW, Su KL, Luo C et al (2013) Numvc: an efficient local search algorithm for minimum vertex cover. J Artif Intell Res 46:687\u2013716","journal-title":"J Artif Intell Res"},{"issue":"7","key":"2813_CR14","first-page":"1","volume":"57","author":"P Huang","year":"2014","unstructured":"Huang P, Yin M (2014) An upper(lower) bound for max(min) CSP. Sci China Inf Sci 57(7):1\u20139","journal-title":"Sci China Inf Sci"},{"issue":"3","key":"2813_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-014-5154-0","volume":"58","author":"J Gao","year":"2015","unstructured":"Gao J, Wang J, Yin M (2015) Experimental analyses on phase transitions in compiling satisfiability problems. Sci China Inf Sci 58(3):1\u201311","journal-title":"Sci China Inf Sci"},{"key":"2813_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5377-8","author":"YY Wang","year":"2015","unstructured":"Wang YY, Ouyang DT, Zhang L et al (2015) A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci China Inf Sci. doi: 10.1007\/s11432-015-5377-8","journal-title":"Sci China Inf Sci"},{"key":"2813_CR17","doi-asserted-by":"crossref","unstructured":"Wang YY, Cai SW, Yin MH (2016) Two efficient local search algorithms for maximum weight clique problem. AAAI2016, pp 805\u2013811","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"2813_CR18","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12280","author":"YY Wang","year":"2016","unstructured":"Wang YY, Yin MH, Ouyang DT et al (2016) A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem. Int Trans Oper Res. doi: 10.1111\/itor.12280","journal-title":"Int Trans Oper Res"},{"key":"2813_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2429-y","author":"RZ Li","year":"2016","unstructured":"Li RZ, Hu SL, Gao J et al (2016) GRASP for connected dominating set problems. Neural Comput Appl. doi: 10.1007\/s00521-016-2429-y","journal-title":"Neural Comput Appl"},{"issue":"1","key":"2813_CR20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1166\/jctn.2016.4869","volume":"13","author":"YP Zhou","year":"2016","unstructured":"Zhou YP, Zhang HC, Li RZ et al (2016) Two local search algorithm for partition vertex cover problem. J Comput Theor Nanosci 13(1):743\u2013751","journal-title":"J Comput Theor Nanosci"},{"issue":"21","key":"2813_CR21","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1049\/el.2016.1243","volume":"52","author":"YY Wang","year":"2016","unstructured":"Wang YY, Ouyang DT, Zhang L (2016) Variable quality checking for backbone computation. Electron Lett 52(21):1769\u20131771","journal-title":"Electron Lett"},{"issue":"80","key":"2813_CR22","first-page":"1","volume":"24","author":"YY Wang","year":"2016","unstructured":"Wang YY, Wang J (2016) An effective local search algorithm for a special hitting set problem. Transylv Rev 24(80):1\u201311","journal-title":"Transylv Rev"},{"key":"2813_CR23","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"RZ Li","year":"2016","unstructured":"Li RZ, Hu SL, Zhang H et al (2016) An efficient local search framework for the minimum weighted vertex cover problem. Inf Sci 372:428\u2013445","journal-title":"Inf Sci"},{"issue":"2011","key":"2813_CR24","first-page":"1672","volume":"175","author":"SW Cai","year":"2011","unstructured":"Cai SW, Su KL, Sattar Abdul et al (2011) Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif Intell 175(2011):1672\u20131696","journal-title":"Artif Intell"},{"key":"2813_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6","author":"YY Wang","year":"2016","unstructured":"Wang YY, Li RZ, Zhou YP, Yin MH (2016) A path cost-based GRASP for minimum independent dominating set problem. Neural Comput Appl. doi: 10.1007\/s00521-016-2324-6","journal-title":"Neural Comput Appl"},{"key":"2813_CR26","volume-title":"Cliques, coloring, and satisfiability: second DIMACS implementation challenge","author":"DS Johnson","year":"1993","unstructured":"Johnson DS, Trick MA (1993) Cliques, coloring, and satisfiability: second DIMACS implementation challenge, vol 26. American Mathematical Society, Providence"},{"key":"2813_CR27","first-page":"297","volume-title":"A memetic approach for the max-cut problem","author":"QH Wu","year":"2012","unstructured":"Wu QH, Hao JK (2012) A memetic approach for the max-cut problem. Springer, Berlin, pp 297\u2013306"},{"issue":"5","key":"2813_CR28","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X Chen","year":"2011","unstructured":"Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evolut Comput 15(5):591\u2013607","journal-title":"IEEE Trans Evolut Comput"},{"issue":"5","key":"2813_CR29","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TEVC.2014.2362558","volume":"19","author":"L Feng","year":"2015","unstructured":"Feng L, Ong YS, Lim MH, Tsang IWH (2015) Memetic search with inter-domain learning: a realization between CVRP and CARP. IEEE Trans Evol Comput 19(5):644\u2013658","journal-title":"IEEE Trans Evol Comput"},{"key":"2813_CR30","doi-asserted-by":"crossref","unstructured":"Hao JK (2012) Memetic algorithms in discrete optimization. In: F, Neri, C. Cotta, P. Moscato (eds) Handbook of memetic algorithms. Studies in Computational Intelligence 379, Chapter 6, pp 73\u201394","DOI":"10.1007\/978-3-642-23247-3_6"},{"issue":"4","key":"2813_CR31","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem: a comparative experiment. IEEE Trans Evolut Comput 6(4):402\u2013412","journal-title":"IEEE Trans Evolut Comput"},{"key":"2813_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2172-9","author":"RZ Li","year":"2016","unstructured":"Li RZ, Hu SL, Wang YY, Yin MH (2016) A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Comput Appl. doi: 10.1007\/s00521-015-2172-9","journal-title":"Neural Comput Appl"},{"issue":"3","key":"2813_CR33","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"2813_CR34","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search-part II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"2813_CR35","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.neunet.2015.03.013","volume":"67","author":"Gu Bin","year":"2015","unstructured":"Bin Gu, Sheng Victor S, Wang Zhijie, Ho Derek, Osman Said, Li Shuo (2015) Incremental learning for \u03bd-support vector regression. Neural Netw 67:140\u2013150","journal-title":"Neural Netw"},{"key":"2813_CR36","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex RM, Resende MGC, Ribeiro CC (2007) TTT plots: a perl program to create time-to-target plots. Optim Lett 1:355\u2013366","journal-title":"Optim Lett"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2813-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2813-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2813-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T07:08:55Z","timestamp":1658387335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2813-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,11]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["2813"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2813-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,11]]}}}