{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:11:15Z","timestamp":1729631475880,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/cec.2013.6557756","type":"proceedings-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T18:57:12Z","timestamp":1374778632000},"page":"1626-1634","source":"Crossref","is-referenced-by-count":5,"title":["A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem"],"prefix":"10.1109","author":[{"given":"Michael J.","family":"Dinneen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuai","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001852"},{"key":"17","first-page":"1563","article-title":"Analysis of population-based evolutionary algorithms for the vertex cover problem","year":"2008","journal-title":"Proc CEC"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001720"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424701"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-007-0281-3"},{"key":"13","volume":"379","author":"neri","year":"2011","journal-title":"Handbook of Memetic Algorithms Studies in Computational Intelligence"},{"key":"14","first-page":"713","article-title":"Randomized local search, evolutionary algorithms and the minimum spanning tree problem","author":"neumann","year":"2004","journal-title":"Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO'04)"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/026\/01","article-title":"Cliques, coloring and satisfiability second DIMACS implementation challenge","volume":"26","author":"johnson","year":"1996","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001711"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144099"},{"key":"20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1998-35123405","article-title":"Finite markov chain results in evolutionary computation: A tour d'horizon","volume":"35","author":"rudolph","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144087"},{"key":"23","first-page":"340","article-title":"Analysis of an iterated local search algorithm for vertex coloring","volume":"6506","author":"sudholt","year":"2010","journal-title":"LNCS"},{"key":"24","first-page":"44","article-title":"Worst-case and average-case aximations by simple randomized search heuristic","volume":"3804","author":"witt","year":"2005","journal-title":"LNCS"},{"key":"25","first-page":"651","article-title":"Runtime analysis of the (+1) ea on simple pseudo-boolean functions","year":"2006","journal-title":"Proceedings of the 8th annual conference on Genetic and Evolutionary Computation"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.01.010"},{"key":"3","first-page":"13","article-title":"On the optimization of unimodal functions with the (1+1) evolutionary algorithm","author":"droste","year":"1998","journal-title":"Proceedings of the 5th International Conference on Parallel Problem Solving from Nature"},{"key":"2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MC.2013.6608203","article-title":"On the analysis of a (1+1) adjusting memetic algorithm","author":"dinneen","year":"2013","journal-title":"Proceedings of Memetic Computing MC2013 IEEE"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32363-5_13"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"6","first-page":"415","article-title":"Evolutionary algorithms and the maximum matching problem","author":"giel","year":"2003","journal-title":"STACS'03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967661"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"}],"event":{"name":"2013 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2013,6,20]]},"location":"Cancun, Mexico","end":{"date-parts":[[2013,6,23]]}},"container-title":["2013 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6552460\/6557545\/06557756.pdf?arnumber=6557756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T18:46:34Z","timestamp":1596221194000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6557756\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cec.2013.6557756","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}