{"id":"https://openalex.org/W2167807475","doi":"https://doi.org/10.1145/1068009.1068111","title":"Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem","display_name":"Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2167807475","doi":"https://doi.org/10.1145/1068009.1068111","mag":"2167807475"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068111","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073112856","display_name":"Bryant A. Julstrom","orcid":null},"institutions":[{"id":"https://openalex.org/I173963315","display_name":"St. Cloud State University","ror":"https://ror.org/016czhx14","country_code":"US","type":"education","lineage":["https://openalex.org/I173963315","https://openalex.org/I91221267"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bryant A. Julstrom","raw_affiliation_strings":["St. Cloud State University, St. Cloud, MN"],"affiliations":[{"raw_affiliation_string":"St. Cloud State University, St. Cloud, MN","institution_ids":["https://openalex.org/I173963315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073112856"],"corresponding_institution_ids":["https://openalex.org/I173963315"],"apc_list":null,"apc_paid":null,"fwci":4.3086,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.93668607,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"607","last_page":"614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9831777811050415},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.76073157787323},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7332326769828796},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6999320387840271},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.6811313629150391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5835700035095215},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5802591443061829},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5502915978431702},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5286729335784912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4234154224395752},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4168049991130829},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39538905024528503},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3398629426956177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3284232020378113}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9831777811050415},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.76073157787323},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7332326769828796},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6999320387840271},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6811313629150391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5835700035095215},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5802591443061829},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5502915978431702},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5286729335784912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4234154224395752},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4168049991130829},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39538905024528503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3398629426956177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3284232020378113}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1068009.1068111","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.4814","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.4814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p607.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W174365240","https://openalex.org/W1586409345","https://openalex.org/W1819439194","https://openalex.org/W1970801029","https://openalex.org/W2011039300","https://openalex.org/W2015206516","https://openalex.org/W2024911991","https://openalex.org/W2040147130","https://openalex.org/W2040678023","https://openalex.org/W2046355282","https://openalex.org/W2086391028","https://openalex.org/W2087999447","https://openalex.org/W2122604873","https://openalex.org/W2135702200","https://openalex.org/W2137023518","https://openalex.org/W2141494354","https://openalex.org/W2157013735","https://openalex.org/W2167925113","https://openalex.org/W2250294758","https://openalex.org/W2401096565","https://openalex.org/W2911740249","https://openalex.org/W3125870905","https://openalex.org/W4236127247","https://openalex.org/W4285719527","https://openalex.org/W6607102223"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2993365626","https://openalex.org/W2412614002","https://openalex.org/W2005493932","https://openalex.org/W2087209118","https://openalex.org/W2378557713","https://openalex.org/W2381035939","https://openalex.org/W2076844787","https://openalex.org/W42170116","https://openalex.org/W1969981152"],"abstract_inverted_index":{"Augmenting":[0],"an":[1,46],"evolutionary":[2],"algorithm":[3],"with":[4,57,125,133],"knowledge":[5],"of":[6,41,53,80,90,101,208],"its":[7,61,116],"target":[8],"problem":[9,69,166],"can":[10],"yield":[11],"a":[12],"more":[13,107,203],"effective":[14],"algorithm,":[15],"as":[16,92,179],"this":[17],"presentation":[18],"illustrates.":[19],"The":[20,127,174],"Quadratic":[21],"Knapsack":[22,27],"Problem":[23,28],"extends":[24,129],"the":[25,51,54,67,75,109,122,130,137,147,181,185,189,196],"familiar":[26],"by":[29,60,152],"assigning":[30],"values":[31,55,123,171],"not":[32],"only":[33,97],"to":[34,39],"individual":[35],"objects":[36,71,91,102,143],"but":[37,184],"also":[38],"pairs":[40],"objects.":[42,126],"In":[43,192],"these":[44],"problems,":[45],"object's":[47],"value":[48,82,157],"density":[49],"is":[50,114],"sum":[52],"associated":[56,124],"it":[58,199],"divided":[59],"weight.":[62],"Two":[63,84],"greedy":[64,134,175,186],"heuristics":[65,176],"for":[66,72,144],"quadratic":[68],"examine":[70,142],"inclusion":[73,145],"in":[74,77,146,149],"knapsack":[76,148,170],"descending":[78],"order":[79],"their":[81],"densities.":[83,158],"genetic":[85],"algorithms":[86,161],"encode":[87],"candidate":[88],"selections":[89,100],"binary":[93],"strings":[94,98],"and":[95],"generate":[96],"whose":[99,168],"have":[103],"total":[104],"weight":[105],"no":[106,119],"than":[108,204],"knapsack's":[110],"capacity.":[111],"One":[112],"GA":[113,132,187],"naive;":[115],"operators":[117,141],"apply":[118],"information":[120],"about":[121],"second":[128],"naive":[131,182],"techniques":[135],"from":[136],"non-evolutionary":[138],"heuristics.":[139],"Its":[140],"orders":[150],"determined":[151],"tournaments":[153],"based":[154],"on":[155,164,195],"objects'":[156],"All":[159],"four":[160],"are":[162,172],"tested":[163],"twenty":[165],"instances":[167],"optimum":[169,201],"known.":[173],"do":[177],"well,":[178],"does":[180],"GA,":[183],"exhibits":[188],"best":[190],"performance.":[191],"repeated":[193],"trials":[194],"test":[197],"instances,":[198],"identifies":[200],"solutions":[202],"nine":[205],"times":[206],"out":[207],"every":[209],"ten.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}