{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:55Z","timestamp":1750307815857,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389251","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"787-794","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Memetic algorithms with variable-depth search to overcome local optima"],"prefix":"10.1145","author":[{"given":"Dirk","family":"Sudholt","sequence":"first","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , 2 nd edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IECON.2000.972425"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_108"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389276"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_6_1","volume-title":"Recent Advances in Memetic Algorithms","author":"Hart W. E.","year":"2004","unstructured":"W. E. Hart , N. Krasnogor , and J. E. Smith , editors . Recent Advances in Memetic Algorithms . Springer , 2004 . W. E. Hart, N. Krasnogor, and J. E. Smith, editors. Recent Advances in Memetic Algorithms. Springer, 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810752"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.02.019"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00133-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_1_13_1","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"Louren\u00e7o H. R.","year":"2002","unstructured":"H. R. Louren\u00e7o , O. Martin , and T. St\u00fctzle . Iterated local search . In Handbook of Metaheuristics , pages 321 -- 353 . Kluwer Academic Publishers , Norwell, MA , 2002 . H. R. Louren\u00e7o, O. Martin, and T. St\u00fctzle. Iterated local search. In Handbook of Metaheuristics, pages 321--353. Kluwer Academic Publishers, Norwell, MA, 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-007-0281-3"},{"key":"e_1_3_2_1_16_1","volume-title":"Computational Complexity","author":"Papadimitriou C.","year":"1994","unstructured":"C. Papadimitriou . Computational Complexity . Addison Wesley , 1994 . C. Papadimitriou. Computational Complexity. Addison Wesley, 1994."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647904.757224"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_37"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144087"},{"key":"e_1_3_2_1_21_1","volume-title":"Complexity Theory - Exploring the Limits of Efficient Algorithms","author":"Wegener I.","year":"2005","unstructured":"I. Wegener . Complexity Theory - Exploring the Limits of Efficient Algorithms . Springer , 2005 . I. Wegener. Complexity Theory - Exploring the Limits of Efficient Algorithms. Springer, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_48"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Atlanta GA USA","acronym":"GECCO08"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":23,"alternative-id":["10.1145\/1389095.1389251","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389251","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}