{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:50Z","timestamp":1759638530390,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"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.1389209","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"593-598","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Feasibility-preserving crossover for maximum k-coverage problem"],"prefix":"10.1145","author":[{"given":"Yourim","family":"Yoon","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}]},{"given":"Yong-Hyuk","family":"Kim","sequence":"additional","affiliation":[{"name":"Kwangwoon University, Seoul, South Korea"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601317"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.07.002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1990.166"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00159-X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2006.02.002"},{"key":"e_1_3_2_1_6_1","first-page":"265","volume-title":"Foundations of Genetic Algorithms","author":"Eshelman L. J.","year":"1991","unstructured":"L. J. Eshelman . The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination . In Foundations of Genetic Algorithms , pages 265 -- 283 . Morgan Kaufmann , 1991 . L. J. Eshelman. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In Foundations of Genetic Algorithms, pages 265--283. Morgan Kaufmann, 1991."},{"key":"e_1_3_2_1_7_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman , San Francisco , 1979 . M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979."},{"key":"e_1_3_2_1_8_1","first-page":"504","volume-title":"Proceedings of the Third Annual Conference on Genetic Programming","author":"Guerra-Salcedo C.","year":"1998","unstructured":"C. Guerra-Salcedo and D. Whitley . Genetic search for feature subset selection: A comparison between CHC and GENESIS . In Proceedings of the Third Annual Conference on Genetic Programming , pages 504 -- 509 . Morgan Kaufmann , 1998 . C. Guerra-Salcedo and D. Whitley. Genetic search for feature subset selection: A comparison between CHC and GENESIS. In Proceedings of the Third Annual Conference on Genetic Programming, pages 504--509. Morgan Kaufmann, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.445"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277128"},{"key":"e_1_3_2_1_13_1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1955","unstructured":"C. H. Papadimitriou and K. Steiglitz . Combinatorial Optimization: Algorithms and Complexity . Prentice-Hall , 1955 . C. H. Papadimitriou and K.Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1955."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00087-1"}],"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.1389209","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389209","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.1389209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":14,"alternative-id":["10.1145\/1389095.1389209","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389209","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"}}]}}