{"id":"https://openalex.org/W2928236413","doi":"https://doi.org/10.1109/acit.2018.8672677","title":"A Survey of the Knapsack Problem","display_name":"A Survey of the Knapsack Problem","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2928236413","doi":"https://doi.org/10.1109/acit.2018.8672677","mag":"2928236413"},"language":"en","primary_location":{"id":"doi:10.1109/acit.2018.8672677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acit.2018.8672677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Arab Conference on Information Technology (ACIT)","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/A5009879303","display_name":"Maram Assi","orcid":"https://orcid.org/0000-0003-1274-7550"},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Maram Assi","raw_affiliation_strings":["Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon","institution_ids":["https://openalex.org/I56306041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078450687","display_name":"Ramzi A. Haraty","orcid":"https://orcid.org/0000-0002-6978-3627"},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Ramzi A. Haraty","raw_affiliation_strings":["Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon","institution_ids":["https://openalex.org/I56306041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.272,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.90395109,"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":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.994124174118042},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8175047636032104},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.6313093304634094},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6312029957771301},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.558912992477417},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5490444898605347},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5259338021278381},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47747230529785156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47065937519073486},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.45705389976501465},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4459102749824524},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4422038793563843},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.36593717336654663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2090950310230255},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1398053765296936}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.994124174118042},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8175047636032104},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6313093304634094},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6312029957771301},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.558912992477417},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5490444898605347},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5259338021278381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47747230529785156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47065937519073486},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.45705389976501465},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4459102749824524},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4422038793563843},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36593717336654663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2090950310230255},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1398053765296936},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acit.2018.8672677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acit.2018.8672677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Arab Conference on Information Technology (ACIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4399999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309999","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21"},{"id":"https://openalex.org/F4320311972","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37"},{"id":"https://openalex.org/F4320322377","display_name":"Universit\u00e9 Libanaise","ror":"https://ror.org/05x6qnc69"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1527373281","https://openalex.org/W1970970009","https://openalex.org/W1982346568","https://openalex.org/W2021328726","https://openalex.org/W2056653303","https://openalex.org/W2066671865","https://openalex.org/W2108088553","https://openalex.org/W2125554210","https://openalex.org/W2156186849","https://openalex.org/W2162727580","https://openalex.org/W2170391791","https://openalex.org/W3134267570","https://openalex.org/W6646048440","https://openalex.org/W6684403462"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2005493932","https://openalex.org/W2381035939","https://openalex.org/W2412614002","https://openalex.org/W2087209118","https://openalex.org/W2122137596","https://openalex.org/W2993365626","https://openalex.org/W2994461947","https://openalex.org/W1969981152","https://openalex.org/W2086077660"],"abstract_inverted_index":{"The":[0],"Knapsack":[1,51,81],"Problem":[2,82],"(KP)":[3],"is":[4],"one":[5],"of":[6,16,30,65,80],"the":[7,17,31,35,77,92],"most":[8],"studied":[9],"combinatorial":[10],"problems.":[11],"There":[12],"are":[13],"many":[14,21],"variations":[15],"problem":[18,60],"along":[19,83],"with":[20,34,84],"real":[22,58],"life":[23,59],"applications.":[24],"KP":[25],"seeks":[26],"to":[27,56,62,90],"select":[28],"some":[29],"available":[32],"items":[33],"maximal":[36],"total":[37],"weight":[38],"in":[39],"a":[40,46,63],"way":[41],"that":[42],"does":[43],"not":[44],"exceed":[45],"given":[47],"maximum":[48],"limit":[49],"L.":[50],"problems":[52],"have":[53],"been":[54],"used":[55],"tackle":[57],"belonging":[61],"variety":[64],"fields":[66],"including":[67],"cryptography":[68],"and":[69,87],"applied":[70],"mathematics.":[71],"In":[72],"this":[73],"paper,":[74],"we":[75],"consider":[76],"different":[78],"instances":[79],"its":[85],"applications":[86],"various":[88],"approaches":[89],"solve":[91],"problem.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}