{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T05:23:32Z","timestamp":1772342612224,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tcyb.2018.2848116","type":"journal-article","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T18:40:27Z","timestamp":1530729627000},"page":"3699-3712","source":"Crossref","is-referenced-by-count":63,"title":["Memetic Search for Identifying Critical Nodes in Sparse Graphs"],"prefix":"10.1109","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4254-6517","authenticated-orcid":false,"given":"Yangming","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8813-4377","authenticated-orcid":false,"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9730-4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0666-x"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-1-4614-2107-8_10","article-title":"Studying connectivity properties in human protein–protein interaction network in cancer pathway","volume":"65","author":"tomaino","year":"2012","journal-title":"Data Mining for Biomarker Discovery"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9458-y"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/net.20464"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2215882"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-015-0010-y"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.09.012"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.02.008"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10817-005-9010-1","article-title":"Clause weighting local search for SAT","volume":"35","author":"thornton","year":"2005","journal-title":"J Autom Reasoning"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2132725"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2546340"},{"key":"ref12","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2170849"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2362558"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-015-0166-x"},{"key":"ref16","first-page":"71","article-title":"Tabu search","author":"glover","year":"1993","journal-title":"Modern Heuristic Techniques for Combinatorial Problems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02078647"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90211-9"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-642-23247-3_6","article-title":"Memetic algorithms in discrete optimization","volume":"379","author":"hao","year":"2012","journal-title":"Handbook of Memetic Algorithms"},{"key":"ref28","first-page":"1","article-title":"Heuristic algorithm for identifying critical nodes in graphs","volume":"5","author":"purevsuren","year":"2016","journal-title":"International Journal of Advanced Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.06.010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-015-9290-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/net.21671"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-1-4419-0534-5_4","article-title":"Cardinality-constrained critical node detection problem","volume":"46","author":"arulselvan","year":"2011","journal-title":"Performance Models and Risk Management in Communications Systems"},{"key":"ref29","first-page":"215","article-title":"Tabu search candidate list strategies in scheduling","volume":"9","author":"rangaswamy","year":"1998","journal-title":"Operations Research\/Computer Science Interfaces Series"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-006-7084-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2136346"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2110-y"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.003"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.03.021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.01.027"},{"key":"ref22","first-page":"40","article-title":"The breakout method for escaping from local minima","author":"morris","year":"1993","journal-title":"Proc 11th AAAI"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","article-title":"A memetic algorithm for graph coloring","volume":"203","author":"l\u00fc","year":"2010","journal-title":"Eur J Oper Res"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3075993"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-23247-3","author":"neri","year":"2012","journal-title":"Handbook of Memetic Algorithms"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2343966"},{"key":"ref23","first-page":"219","article-title":"Memetic algorithms: A short introduction","author":"moscato","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2674800"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2010.936309"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.07.047"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","article-title":"Classification of adaptive memetic algorithms: A comparative study","volume":"36","author":"ong","year":"2006","journal-title":"IEEE Trans Syst Man Cybern B Cybern"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8747513\/08403891.pdf?arnumber=8403891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T14:41:32Z","timestamp":1693752092000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8403891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2018.2848116","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}