{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:13:10Z","timestamp":1756681990872,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"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.1389202","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"539-546","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Crossover can provably be useful in evolutionary computation"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Edda","family":"Happ","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Christian","family":"Klein","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/TEVC.2002.804323"},{"doi-asserted-by":"crossref","unstructured":"N. Alon and J. H. Spencer. The Probabilistic Method. Wiley 2nd edition 2000.  N. Alon and J. H. Spencer. The Probabilistic Method. Wiley 2nd edition 2000.","key":"e_1_3_2_1_2_1","DOI":"10.1002\/0471722154"},{"unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. MIT Press 2nd edition 2001.   T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. MIT Press 2nd edition 2001.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","first-page":"1890","volume-title":"Proc. of CEC '07","author":"Doerr B.","year":"2007"},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"1113","volume-title":"Proc. of GECCO '04","author":"Fischer S.","year":"2004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/367766.368168"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.5555\/645513"},{"unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. 1979.   M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. 1979.","key":"e_1_3_2_1_8_1"},{"volume-title":"University of Michigan Press","year":"1975","author":"Holland J. H.","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/ISCAS.1999.780114"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"184","volume-title":"Proc. of ESA '99","author":"Jansen T.","year":"1999"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/j.dam.2004.02.019"},{"volume-title":"PWS Publishing","year":"1996","author":"Jerrum M.","key":"e_1_3_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/321992.321993"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_16_1","first-page":"88","volume-title":"Proc. of GECCO '02","author":"Liang S.","year":"2002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.asoc.2005.01.005"},{"volume-title":"Cambridge University Press","year":"1999","author":"Mehlhorn K.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1063\/1.1699114"},{"unstructured":"M.\n       \n      Mitchell J. H.\n       \n      Holland and \n      \n      \n      S.\n       \n      Forrest\n      \n  \n  . \n  When will a genetic algorithm outperform hill climbing? In Proc. of NIPS '93 volume \n  6\n   of \n  Advances in Neural Information Processing Systems pages \n  51\n  --\n  58\n  . \n  Morgan Kaufmann 1993\n  .   M. Mitchell J. H. Holland and S. Forrest. When will a genetic algorithm outperform hill climbing? In Proc. of NIPS '93 volume 6 of Advances in Neural Information Processing Systems pages 51--58. Morgan Kaufmann 1993.","key":"e_1_3_2_1_20_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/225058.225088"},{"key":"e_1_3_2_1_22_1","first-page":"215","volume-title":"Proc. of ICGA '94","author":"Rabinovich Y.","year":"1991"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.5555\/312578.312580"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1016\/j.tcs.2004.03.047"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1068009.1068202"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/321105.321107"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/11523468_48"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/s00453-002-0940-2"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"acronym":"GECCO08","name":"GECCO08: Genetic and Evolutionary Computation Conference","location":"Atlanta GA USA"},"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.1389202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:40Z","timestamp":1750255060000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":29,"alternative-id":["10.1145\/1389095.1389202","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389202","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"}}]}}