{"id":"https://openalex.org/W166295807","doi":null,"title":"Adaptive Algorithm for Solving Knapsack Problem","display_name":"Adaptive Algorithm for Solving Knapsack Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W166295807","mag":"166295807"},"language":"en","primary_location":{"id":"mag:166295807","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTotal-JSJC200804005.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764825856","display_name":"Jisuanji gongcheng","issn_l":"1000-3428","issn":["1000-3428"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","poland-20"],"host_organization":"https://openalex.org/P4361727472","host_organization_name":"East China Computer Technology Research Institute","host_organization_lineage":["https://openalex.org/P4361727472"],"host_organization_lineage_names":["East China Computer Technology Research Institute"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jisuanji gongcheng","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5109863201","display_name":"Li Xiang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3130751423","display_name":"Shaoguan University","ror":"https://ror.org/0286g6711","country_code":"CN","type":"education","lineage":["https://openalex.org/I3130751423"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Li Xiang","raw_affiliation_strings":["Department of Computer,Guangzhou Shaoguan University,Shaoguan 512005)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer,Guangzhou Shaoguan University,Shaoguan 512005)","institution_ids":["https://openalex.org/I3130751423"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109863201"],"corresponding_institution_ids":["https://openalex.org/I3130751423"],"apc_list":null,"apc_paid":null,"fwci":0.7636,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77237027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8773999810218811,"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.8773999810218811,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07090000063180923,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.008700000122189522,"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":1.0},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.5440000295639038},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.703000009059906},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.8859999775886536},{"id":"https://openalex.org/keywords/processor-count","display_name":"processor count","score":0.36800000071525574},{"id":"https://openalex.org/keywords/hardware-utilization","display_name":"hardware resource utilization","score":0.625}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9887279868125916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8338629007339478},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8112768530845642},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6954742074012756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.610981285572052},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5649132132530212},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5471131801605225},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4416532516479492},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3933522701263428},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3248077630996704},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23091959953308105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1420295536518097},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:166295807","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTotal-JSJC200804005.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764825856","display_name":"Jisuanji gongcheng","issn_l":"1000-3428","issn":["1000-3428"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","poland-20"],"host_organization":"https://openalex.org/P4361727472","host_organization_name":"East China Computer Technology Research Institute","host_organization_lineage":["https://openalex.org/P4361727472"],"host_organization_lineage_names":["East China Computer Technology Research Institute"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jisuanji gongcheng","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1549807246","https://openalex.org/W1978651921","https://openalex.org/W2015799924","https://openalex.org/W2045492613","https://openalex.org/W2064207223","https://openalex.org/W2083604840"],"related_works":["https://openalex.org/W2064207223","https://openalex.org/W2352476958","https://openalex.org/W1978651921","https://openalex.org/W6941191061","https://openalex.org/W2569548927","https://openalex.org/W2022443350","https://openalex.org/W2075530792","https://openalex.org/W2117709812","https://openalex.org/W1978530168","https://openalex.org/W2272069424"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,6,17,31,56,62,68],"two-list":[3,7],"algorithm":[4,14,69],"and":[5,46],"four-table":[8],"algorithm,this":[9],"paper":[10],"proposes":[11],"parallel":[12],"adaptive":[13],"for":[15],"solving":[16],"knapsack":[18,32],"problem.It":[19],"uses":[20],"2\u03b4":[21],"processors,O(e":[22],"2(n-\u03b4)/":[23],"2)":[24],"time,and":[25],"O(2(n":[26],"+\u03b4)/2-e)":[27],"memory":[28,49],"to":[29,60],"solve":[30],"problem(0\u2264\u03b4":[33],"\u2264n":[34],"/5,1\u2264e":[35],"\u2264(n-\u03b4)/":[36],"4),whose":[37],"parameter":[38],"can":[39,51],"be":[40],"selected":[41],"by":[42],"numbers":[43],"of":[44,48,55],"processors":[45],"amounts":[47],"that":[50,67],"make":[52],"full":[53],"use":[54],"existing":[57],"hardware":[58],"resources":[59],"find":[61],"fastest":[63],"solution.Experimental":[64],"results":[65],"show":[66],"is":[70],"effective.":[71]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}