{"id":"https://openalex.org/W1978651921","doi":"https://doi.org/10.1109/tc.1984.1676456","title":"A Parallel Algorithm for the Knapsack Problem","display_name":"A Parallel Algorithm for the Knapsack Problem","publication_year":1984,"publication_date":"1984-05-01","ids":{"openalex":"https://openalex.org/W1978651921","doi":"https://doi.org/10.1109/tc.1984.1676456","mag":"1978651921"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1984.1676456","doi":"https://doi.org/10.1109/tc.1984.1676456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1984.1676456","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5097961115","display_name":"Karnin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210087032","display_name":"Cambridge Scientific (United States)","ror":"https://ror.org/001s4dh65","country_code":"US","type":"company","lineage":["https://openalex.org/I4210087032"]},{"id":"https://openalex.org/I4210167297","display_name":"IBM Research - Haifa","ror":"https://ror.org/05rw9t746","country_code":"IL","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210167297"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"Karnin","raw_affiliation_strings":["IBM Scientific Center","IBM Research Laboratory, San Jose, CA, USA","IBM Scientific Center, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Scientific Center","institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210087032"]},{"raw_affiliation_string":"IBM Research Laboratory, San Jose, CA, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM Scientific Center, Haifa, Israel","institution_ids":["https://openalex.org/I4210167297"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5097961115"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210087032","https://openalex.org/I4210167297"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":1.4201,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.77266963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"C-33","issue":"5","first_page":"404","last_page":"408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7095000147819519,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7095000147819519,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.0997999981045723,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.07819999754428864,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9990000128746033},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9890000224113464},{"id":"https://openalex.org/keywords/exhaustive-search","display_name":"exhaustive search","score":0.7950000166893005},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8299999833106995},{"id":"https://openalex.org/keywords/machinery-costs","display_name":"machinery costs","score":0.4580000042915344}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9857149720191956},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7199611663818359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.681270956993103},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6246650218963623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4851468503475189},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.48290371894836426},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4293798506259918},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4280218482017517},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42619121074676514},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.41729769110679626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2757623791694641},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.18495401740074158},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1984.1676456","doi":"https://doi.org/10.1109/tc.1984.1676456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1984.1676456","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W208175943","https://openalex.org/W2011039300","https://openalex.org/W2028557848","https://openalex.org/W2045492613","https://openalex.org/W2086800870","https://openalex.org/W2127371643","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2075530792","https://openalex.org/W2021469991","https://openalex.org/W2064207223","https://openalex.org/W2151152538","https://openalex.org/W2986421620","https://openalex.org/W2052394037","https://openalex.org/W2569548927","https://openalex.org/W166295807","https://openalex.org/W1978530168","https://openalex.org/W2004268641"],"abstract_inverted_index":{"A":[0],"time\u2013memory-processor":[1,50],"tradeoff":[2],"for":[3],"the":[4,31,53,58,65,68,71,82,88,91,95],"knapsack":[5,20],"problem":[6,32],"is":[7,45,64,81,87],"proposed.":[8],"While":[9],"an":[10,18,46],"exhaustive":[11],"search":[12],"over":[13,48],"all":[14],"possible":[15],"solutions":[16],"of":[17,67,73,90],"n-component":[19],"requires":[21,37],"T":[22],"=":[23,60],"0(2n)":[24],"running":[25,96],"time,":[26],"our":[27],"parallel":[28],"algorithm":[29],"solves":[30],"in":[33],"O(2n/2)":[34],"operations":[35],"and":[36,41,76,79],"only":[38,54],"0(2n/6)":[39],"processors":[40,75],"memory":[42,77],"cells.":[43],"It":[44],"improvement":[47],"previous":[49],"tradeoffs,":[51],"being":[52],"one":[55],"which":[56,86],"outperforms":[57],"CmCs":[59],"2\"":[61],"curve.":[62],"Cm":[63],"cost":[66,83,93],"machine,":[69],"i.e.,":[70],"number":[72],"its":[74],"cells,":[78],"C,":[80],"per":[84],"solution,":[85],"product":[89],"machine":[92],"by":[94],"time.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}