{"id":"https://openalex.org/W2071566992","doi":"https://doi.org/10.1007/bf01407836","title":"A parallel algorithm for the 0?1 knapsack problem","display_name":"A parallel algorithm for the 0?1 knapsack problem","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2071566992","doi":"https://doi.org/10.1007/bf01407836","mag":"2071566992"},"language":"en","primary_location":{"id":"doi:10.1007/bf01407836","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01407836","pdf_url":null,"source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","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/A5009535419","display_name":"W. Loots","orcid":null},"institutions":[{"id":"https://openalex.org/I24027795","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17","country_code":"ZA","type":"education","lineage":["https://openalex.org/I24027795"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"W. Loots","raw_affiliation_strings":["Department of Computer Science, Rand Afrikaans University, P.O. Box 524, 2000, Johannesburg, South Africa","Department of Computer Science, Rand Afrikaans University, Johannesburg, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rand Afrikaans University, P.O. Box 524, 2000, Johannesburg, South Africa","institution_ids":["https://openalex.org/I24027795"]},{"raw_affiliation_string":"Department of Computer Science, Rand Afrikaans University, Johannesburg, South Africa","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085467448","display_name":"T. H. C. Smith","orcid":null},"institutions":[{"id":"https://openalex.org/I24027795","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17","country_code":"ZA","type":"education","lineage":["https://openalex.org/I24027795"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"T. H. C. Smith","raw_affiliation_strings":["Department of Computer Science, Rand Afrikaans University, P.O. Box 524, 2000, Johannesburg, South Africa","Department of Computer Science, Rand Afrikaans University, Johannesburg, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rand Afrikaans University, P.O. Box 524, 2000, Johannesburg, South Africa","institution_ids":["https://openalex.org/I24027795"]},{"raw_affiliation_string":"Department of Computer Science, Rand Afrikaans University, Johannesburg, South Africa","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.035,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79596786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"21","issue":"5","first_page":"349","last_page":"362"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9965999722480774,"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.9965999722480774,"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.9314385652542114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7691237330436707},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6864663362503052},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6778202056884766},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.599128782749176},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5957211256027222},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5724567174911499},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5395680069923401},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5183730721473694},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4773945212364197},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4706748425960541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4706002175807953},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.24306491017341614}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9314385652542114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7691237330436707},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6864663362503052},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6778202056884766},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.599128782749176},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5957211256027222},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5724567174911499},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5395680069923401},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5183730721473694},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4773945212364197},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4706748425960541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4706002175807953},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.24306491017341614}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01407836","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01407836","pdf_url":null,"source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1978530168","https://openalex.org/W1981434190","https://openalex.org/W2001539517","https://openalex.org/W2005933636","https://openalex.org/W2019529419","https://openalex.org/W2045492613","https://openalex.org/W2060322444","https://openalex.org/W2066671865","https://openalex.org/W2086077660","https://openalex.org/W2095187311","https://openalex.org/W2618995073"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W2889442766","https://openalex.org/W4249611560","https://openalex.org/W1483913682","https://openalex.org/W1538797328","https://openalex.org/W2048876360","https://openalex.org/W2042215625","https://openalex.org/W2066850897","https://openalex.org/W2045247420","https://openalex.org/W2020030076"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}