{"id":"https://openalex.org/W2100183008","doi":"https://doi.org/10.1145/1068009.1068114","title":"An evolutionary lagrangian method for the 0/1 multiple knapsack problem","display_name":"An evolutionary lagrangian method for the 0/1 multiple knapsack problem","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2100183008","doi":"https://doi.org/10.1145/1068009.1068114","mag":"2100183008"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068114","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/A5006119424","display_name":"Yourim Yoon","orcid":"https://orcid.org/0000-0001-5875-0275"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yourim Yoon","raw_affiliation_strings":["Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046031351","display_name":"Yong-Hyuk Kim","orcid":"https://orcid.org/0000-0002-0492-0889"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yong-Hyuk Kim","raw_affiliation_strings":["Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022911578","display_name":"Byung-Ro Moon","orcid":"https://orcid.org/0000-0002-4968-2159"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Byung-Ro Moon","raw_affiliation_strings":["Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006119424"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":3.4036,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91957595,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"629","last_page":"635"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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.9995999932289124,"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.9952999949455261,"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.9775999784469604,"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.942608118057251},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.8569827079772949},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7616105079650879},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7234928607940674},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6972643733024597},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5898734927177429},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.5632609128952026},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5546954274177551},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5211051106452942},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49199172854423523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48660123348236084},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4674704074859619},{"id":"https://openalex.org/keywords/constraint-algorithm","display_name":"Constraint algorithm","score":0.4643315374851227},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.4547145366668701},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4288625717163086},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42501527070999146},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.1977694034576416}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.942608118057251},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.8569827079772949},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7616105079650879},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7234928607940674},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6972643733024597},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5898734927177429},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.5632609128952026},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5546954274177551},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5211051106452942},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49199172854423523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48660123348236084},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4674704074859619},{"id":"https://openalex.org/C15980293","wikidata":"https://www.wikidata.org/wiki/Q5164368","display_name":"Constraint algorithm","level":3,"score":0.4643315374851227},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.4547145366668701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4288625717163086},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42501527070999146},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.1977694034576416},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1068009.1068114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068114","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321292","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542"},{"id":"https://openalex.org/F4320322348","display_name":"Korea Science and Engineering Foundation","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W7875117","https://openalex.org/W28639706","https://openalex.org/W114802202","https://openalex.org/W123765585","https://openalex.org/W254944847","https://openalex.org/W1489512665","https://openalex.org/W1526749820","https://openalex.org/W1534416612","https://openalex.org/W1559215823","https://openalex.org/W1570502648","https://openalex.org/W1586409345","https://openalex.org/W1608877958","https://openalex.org/W1639032689","https://openalex.org/W1661188838","https://openalex.org/W1792365433","https://openalex.org/W1968143987","https://openalex.org/W1991540883","https://openalex.org/W2011039300","https://openalex.org/W2013198217","https://openalex.org/W2022338859","https://openalex.org/W2031666601","https://openalex.org/W2040147130","https://openalex.org/W2050216598","https://openalex.org/W2055037276","https://openalex.org/W2066671865","https://openalex.org/W2081751877","https://openalex.org/W2089047615","https://openalex.org/W2093436788","https://openalex.org/W2112089894","https://openalex.org/W2139211712","https://openalex.org/W2152150600","https://openalex.org/W2155341688","https://openalex.org/W2157013735","https://openalex.org/W2159436229","https://openalex.org/W2476096155","https://openalex.org/W2501430986","https://openalex.org/W2579162708","https://openalex.org/W3023540311","https://openalex.org/W4242130683","https://openalex.org/W4285719527","https://openalex.org/W4301791120","https://openalex.org/W6631919705","https://openalex.org/W6653593260"],"related_works":["https://openalex.org/W2360271985","https://openalex.org/W2131718214","https://openalex.org/W2002987466","https://openalex.org/W2070276483","https://openalex.org/W3207854495","https://openalex.org/W1972437117","https://openalex.org/W2467306310","https://openalex.org/W1973889396","https://openalex.org/W1522162180","https://openalex.org/W2130940832"],"abstract_inverted_index":{"We":[0,13,63,86,97],"propose":[1,64],"a":[2,18],"new":[3,19],"evolutionary":[4],"approach":[5,14,103],"to":[6,52,57,68],"solve":[7],"the":[8,15,30,36,39,45,58,61,70,77,88,91,95],"0/1":[9],"multiple":[10],"knapsack":[11],"problem.":[12,62],"problem":[16],"from":[17,22],"viewpoint":[20],"different":[21],"traditional":[23],"methods.":[24],"The":[25],"most":[26],"remarkable":[27],"feature":[28],"is":[29,49],"Lagrangian":[31],"method.":[32],"Lagrange":[33,54,72],"multipliers":[34,55],"transform":[35],"problem,":[37],"keeping":[38],"optimality":[40],"as":[41,43],"well":[42],"decreasing":[44],"complexity.":[46],"However,":[47],"it":[48],"not":[50],"easy":[51],"find":[53,69],"nearest":[56],"constraints":[59],"of":[60,90],"an":[65],"evolution":[66,78],"strategy":[67,79],"optimal":[71],"multipliers.":[73],"Also,":[74],"we":[75],"improve":[76],"by":[80,94],"adjusting":[81],"its":[82],"objective":[83],"function":[84],"properly.":[85],"show":[87],"efficiency":[89],"proposed":[92],"methods":[93],"experiments.":[96],"make":[98],"comparisons":[99],"with":[100],"existing":[101],"general":[102],"on":[104],"well-known":[105],"benchmark":[106],"data.":[107]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}