{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:59:23Z","timestamp":1769313563212,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"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":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068111","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"607-614","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem"],"prefix":"10.1145","author":[{"given":"Bryant A.","family":"Julstrom","sequence":"first","affiliation":[{"name":"St. Cloud State University, St. Cloud, MN"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ISMP'97","author":"Billionnet A.","year":"1997","unstructured":"A. Billionnet , A. Faye , and E. Soutif . An exact algorithm for the 0-1 quadratic knapsack problem . In ISMP'97 , Lausanne, Switzerland , 1997 . A. Billionnet, A. Faye, and E. Soutif. An exact algorithm for the 0-1 quadratic knapsack problem. In ISMP'97, Lausanne, Switzerland, 1997."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00244-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0029"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.125"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"e_1_3_2_1_6_1","volume-title":"INA","author":"Drezner Zvi","year":"2002","unstructured":"Zvi Drezner , Peter M. Hahn , and \u00c9ric D. Taillard . A study of quadratic assignment problem instances that are difficult for meta-heuristic methods. Technical report , INA , Yverdon-les-bains , 2002 . INA technical report. Zvi Drezner, Peter M. Hahn, and \u00c9ric D. Taillard. A study of quadratic assignment problem instances that are difficult for meta-heuristic methods. Technical report, INA, Yverdon-les-bains, 2002. INA technical report."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592198"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120892"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson . Computers and Intractibility: A Guide to the Theory of NP-Completeness . W. H. Freeman and Company , New York , 1979 . Michael R. Garey and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"e_1_3_2_1_10_1","first-page":"38","volume-title":"AE'99: Selected Papers form the 4th European Conference on Artificial Evolution","author":"Gottlieb Jens","year":"2000","unstructured":"Jens Gottlieb and G\u00fcnther R. Raidl . Characterizing locality in decoder-based EAs for the Multidimensional Knapsack Problem. In Cyril Fonlupt, Jin-Kao Hao, Evelyne Lutton, Edmund Ronald, and Marc Schoenauer, editors , AE'99: Selected Papers form the 4th European Conference on Artificial Evolution , pages 38 -- 52 , Berlin , 2000 . Springer-Verlag. Jens Gottlieb and G\u00fcnther R. Raidl. Characterizing locality in decoder-based EAs for the Multidimensional Knapsack Problem. In Cyril Fonlupt, Jin-Kao Hao, Evelyne Lutton, Edmund Ronald, and Marc Schoenauer, editors, AE'99: Selected Papers form the 4th European Conference on Artificial Evolution, pages 38--52, Berlin, 2000. Springer-Verlag."},{"issue":"3","key":"e_1_3_2_1_11_1","first-page":"170","article-title":"Rader, Jr. Efficient methods for solving quadratic 0-1 knapsack problems","volume":"35","author":"Hammer Peter L.","year":"1997","unstructured":"Peter L. Hammer and David J . Rader, Jr. Efficient methods for solving quadratic 0-1 knapsack problems . INFOR , 35 ( 3 ): 170 -- 182 , 1997 . Peter 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_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009898604624"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585164"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934412"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"Kellerer Hans","year":"2004","unstructured":"Hans Kellerer , Ulrich Pferschy , and David Pisinger . Knapsack Problems . Springer , Berlin , 2004 . Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack Problems. Springer, Berlin, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/326619.326694"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.3.454"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00359-2"},{"key":"e_1_3_2_1_19_1","first-page":"417","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Merz Peter","year":"1999","unstructured":"Peter Merz and Bernd Freisleben . Genetic algorithms for binary quadratic programming. In Wolfgang Banzhaf et~al., editor , Proceedings of the Genetic and Evolutionary Computation Conference , pages 417 -- 424 , San Francisco, CA , 1999 . Morgan Kaufman. Peter Merz and Bernd Freisleben. Genetic algorithms for binary quadratic programming. In Wolfgang Banzhaf et~al., editor, Proceedings of the Genetic and Evolutionary Computation Conference, pages 417--424, San Francisco, CA, 1999. Morgan Kaufman."},{"key":"e_1_3_2_1_20_1","volume-title":"Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems, 78(1--3):99--118","author":"Merz Peter","year":"2004","unstructured":"Peter Merz and Bernd Freisleben . Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems, 78(1--3):99--118 , 2004 . Peter Merz and Bernd Freisleben. Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems, 78(1--3):99--118, 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00299-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699502"},{"key":"e_1_3_2_1_23_1","first-page":"596","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation CEC99","author":"Raidl G\u00fcnther R.","year":"1999","unstructured":"G\u00fcnther R. Raidl . Weight-codings in a genetic algorithm for the multiconstrained knapsack problem . In Proceedings of the 1999 Congress on Evolutionary Computation CEC99 , pages 596 -- 603 , Piscataway, NJ , 1999 . IEEE Press. G\u00fcnther R. Raidl. Weight-codings in a genetic algorithm for the multiconstrained knapsack problem. In Proceedings of the 1999 Congress on Evolutionary Computation CEC99, pages 596--603, Piscataway, NJ, 1999. IEEE Press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.3.200"}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","location":"Washington DC USA","acronym":"GECCO05","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:59Z","timestamp":1750262879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":24,"alternative-id":["10.1145\/1068009.1068111","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068111","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}