{"id":"https://openalex.org/W2022443350","doi":"https://doi.org/10.1016/0743-7315(90)90139-g","title":"Adaptive parallel algorithms for integral knapsack problems","display_name":"Adaptive parallel algorithms for integral knapsack problems","publication_year":1990,"publication_date":"1990-04-01","ids":{"openalex":"https://openalex.org/W2022443350","doi":"https://doi.org/10.1016/0743-7315(90)90139-g","mag":"2022443350"},"language":"en","primary_location":{"id":"doi:10.1016/0743-7315(90)90139-g","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0743-7315(90)90139-g","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed Computing","raw_type":"journal-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/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":["Department of Computer Science, University of Southern California, Los Angeles, California 90089, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, Los Angeles, California 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102005063"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":{"value":3160,"currency":"USD","value_usd":3160},"apc_paid":null,"fwci":4.4913,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.93835616,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":"4","first_page":"400","last_page":"406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9955000281333923,"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.9934999942779541,"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.971309244632721},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7607501149177551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6327288150787354},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6067250967025757},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.569831132888794},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5564108490943909},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5136224627494812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.464161217212677},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.45297756791114807},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4246377646923065},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4221119284629822},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42165160179138184},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41370058059692383},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3643478751182556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3599538803100586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35966283082962036},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2969249486923218},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16372272372245789}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.971309244632721},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7607501149177551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6327288150787354},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6067250967025757},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.569831132888794},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5564108490943909},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5136224627494812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.464161217212677},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.45297756791114807},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4246377646923065},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4221119284629822},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42165160179138184},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41370058059692383},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3643478751182556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3599538803100586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35966283082962036},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2969249486923218},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16372272372245789}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0743-7315(90)90139-g","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0743-7315(90)90139-g","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W33389323","https://openalex.org/W638329186","https://openalex.org/W1558316751","https://openalex.org/W1655990431","https://openalex.org/W1969008575","https://openalex.org/W1988294273","https://openalex.org/W1992734168","https://openalex.org/W2013444956","https://openalex.org/W2038793519","https://openalex.org/W2045492613","https://openalex.org/W2048723395","https://openalex.org/W2066356146","https://openalex.org/W2079885221","https://openalex.org/W2081256023","https://openalex.org/W2087323281","https://openalex.org/W2088956149","https://openalex.org/W2116078914","https://openalex.org/W2125690626","https://openalex.org/W2143462372","https://openalex.org/W2147868775","https://openalex.org/W2149410722","https://openalex.org/W2165968314","https://openalex.org/W2401610261","https://openalex.org/W4206658214","https://openalex.org/W6631300487","https://openalex.org/W6644040475","https://openalex.org/W6662809232","https://openalex.org/W6670928599"],"related_works":["https://openalex.org/W2087209118","https://openalex.org/W2993365626","https://openalex.org/W179363847","https://openalex.org/W2020081923","https://openalex.org/W2041040939","https://openalex.org/W4249611560","https://openalex.org/W2810989909","https://openalex.org/W2122137596","https://openalex.org/W4281741337","https://openalex.org/W2088181319"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}