{"id":"https://openalex.org/W2047562591","doi":"https://doi.org/10.1080/10637199308915436","title":"THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM","display_name":"THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2047562591","doi":"https://doi.org/10.1080/10637199308915436","mag":"2047562591"},"language":"en","primary_location":{"id":"doi:10.1080/10637199308915436","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199308915436","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5051333590","display_name":"Graham M. Megson","orcid":null},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"G. M. MEGSON","raw_affiliation_strings":["Department of Computing Science , University of Newcastle-upon-Tyne, Claremont Tower , Claremont Road, Newcastle-upon-Tyne, UK , NE1 7RU"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science , University of Newcastle-upon-Tyne, Claremont Tower , Claremont Road, Newcastle-upon-Tyne, UK , NE1 7RU","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051333590"],"corresponding_institution_ids":["https://openalex.org/I84884186"],"apc_list":null,"apc_paid":null,"fwci":1.0478,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7811804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"2","first_page":"127","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9939000010490417,"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.9939000010490417,"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/T10171","display_name":"Biofuel production and bioconversion","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.960099995136261,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9851768016815186},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7554113268852234},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6372682452201843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6156641244888306},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5475606918334961},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.47373640537261963},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4616023898124695},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4200226664543152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4080751836299896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3724339008331299},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3266931474208832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26472389698028564},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2414390742778778}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9851768016815186},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7554113268852234},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6372682452201843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6156641244888306},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5475606918334961},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.47373640537261963},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4616023898124695},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4200226664543152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4080751836299896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3724339008331299},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3266931474208832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26472389698028564},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2414390742778778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199308915436","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199308915436","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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":15,"referenced_works":["https://openalex.org/W154860494","https://openalex.org/W1546066461","https://openalex.org/W2003189603","https://openalex.org/W2011039300","https://openalex.org/W2039352681","https://openalex.org/W2055804526","https://openalex.org/W2079092669","https://openalex.org/W2085376012","https://openalex.org/W2092988381","https://openalex.org/W2117404562","https://openalex.org/W2158217275","https://openalex.org/W2614099084","https://openalex.org/W4210546998","https://openalex.org/W4234407207","https://openalex.org/W4297938174"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W2889442766","https://openalex.org/W2168163332","https://openalex.org/W2378557713","https://openalex.org/W4249611560","https://openalex.org/W4389887952","https://openalex.org/W1966986652","https://openalex.org/W1563501581","https://openalex.org/W2367132302","https://openalex.org/W2142105839"],"abstract_inverted_index":{"A":[0],"mapping":[1],"procedure":[2],"for":[3],"synthesizing":[4],"uniform":[5],"recurrence":[6,29],"equations":[7,30],"from":[8,25],"the":[9,14,26,62,67,73],"dynamic":[10],"programming":[11],"formulation":[12],"of":[13,28,33,69],"knapsack":[15,63],"problem":[16],"is":[17,36,61,66,72,84],"proposed.":[18],"Two":[19],"new":[20],"systolic":[21],"arrays":[22,35],"are":[23],"synthesized":[24],"systems":[27],"produced.":[31],"One":[32],"these":[34],"optimal":[37],"with":[38],"respect":[39],"to":[40],"both":[41],"speedup":[42],"and":[43,45,54,80],"efficiency":[44],"requires":[46],"O(":[47,55],"nb/q":[48],"+":[49],"n":[50,65],"\u2212":[51],"n/q)":[52],"time":[53],"q[wmax":[56],"/2])":[57],"processors,":[58],"where":[59],"b":[60],"capacity,":[64],"number":[68],"items,":[70,79],"wmax":[71],"maximum":[74],"weight":[75],"taken":[76],"over":[77],"all":[78],"q":[81],">":[82],"0":[83],"an":[85],"arbitrary":[86],"chosen":[87],"design":[88],"parameter.":[89]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}