{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:52:57Z","timestamp":1762390377667,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"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":[[2009,7,8]]},"DOI":"10.1145\/1569901.1569941","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"279-286","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Evolving heuristically difficult instances of combinatorial problems"],"prefix":"10.1145","author":[{"given":"Bryant A.","family":"Julstrom","sequence":"first","affiliation":[{"name":"St. Cloud State University, St. Cloud, MN, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007527"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0029"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.125"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/783737.784092"},{"issue":"3","key":"e_1_3_2_1_5_1","first-page":"170","article-title":"Rader, Jr. Efficient methods for solving quadratic 0--1 knapsack problems","volume":"35","author":"Hammer P. L.","year":"1997","unstructured":"P. L. Hammer and David J . Rader, Jr. Efficient methods for solving quadratic 0--1 knapsack problems . INFOR , 35 ( 3 ): 170 -- 182 , 1997 . P. L. Hammer and David J. Rader, Jr. Efficient methods for solving quadratic 0--1 knapsack problems. INFOR, 35(3):170--182, 1997.","journal-title":"INFOR"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1689(199912)9:4<263::AID-STVR190>3.0.CO;2-Y"}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569941","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1569941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:49Z","timestamp":1750249069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":7,"alternative-id":["10.1145\/1569901.1569941","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1569941","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}