{"id":"https://openalex.org/W2352476958","doi":null,"title":"An Adaptive Algorithm for the Knapsack Problem","display_name":"An Adaptive Algorithm for the Knapsack Problem","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2352476958","mag":"2352476958"},"language":"en","primary_location":{"id":"mag:2352476958","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JFYZ200407035","pdf_url":null,"source":{"id":"https://openalex.org/S4210240373","display_name":"Journal of Computer Research and Development","issn_l":"1000-1239","issn":["1000-1239"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-40","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computer Research and Development","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2352476958"],"child_works_count":0,"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/A5049288610","display_name":"LI Ken","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"LI Ken","raw_affiliation_strings":["-Li    1,2 ,LI Qing-Hua  1,DAI Guang-Ming  1,and ZHOU Yan-Tao  2      1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"-Li    1,2 ,LI Qing-Hua  1,DAI Guang-Ming  1,and ZHOU Yan-Tao  2      1","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5049288610"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5516,"has_fulltext":false,"cited_by_count":9,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.88115734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8539999723434448,"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.8539999723434448,"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.08389999717473984,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/adaptive-algorithms","display_name":"adaptive algorithms","score":0.9020000100135803},{"id":"https://openalex.org/keywords/cryptanalysis","display_name":"cryptanalysis","score":0.5120000243186951},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.7649999856948853},{"id":"https://openalex.org/keywords/time-memory-trade-off","display_name":"time-memory trade-off","score":0.47999998927116394},{"id":"https://openalex.org/keywords/public-key-cryptosystems","display_name":"public-key cryptosystems","score":0.5899999737739563}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9929904937744141},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8403488397598267},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.7658278942108154},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6665595173835754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6305776238441467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5903525948524475},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5890008807182312},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.510162353515625},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.47925281524658203},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4670015573501587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35982006788253784},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3114722669124603}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2352476958","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JFYZ200407035","pdf_url":null,"source":{"id":"https://openalex.org/S4210240373","display_name":"Journal of Computer Research and Development","issn_l":"1000-1239","issn":["1000-1239"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-40","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computer Research and Development","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W166295807","https://openalex.org/W6941191061","https://openalex.org/W2374643476","https://openalex.org/W2228474866","https://openalex.org/W2045492613","https://openalex.org/W2370294687","https://openalex.org/W1998796848","https://openalex.org/W1549807246","https://openalex.org/W7417612","https://openalex.org/W1564748185"],"abstract_inverted_index":{"The":[0,85,117],"knapsack":[1,49,71,110,132],"problem":[2,7,50],"is":[3,14,20,51],"a":[4],"classic":[5],"NP-hard":[6],"in":[8,23,90,97,139],"the":[9,18,24,33,38,46,55,65,68,91,98,106,109,113,121,126,131,140,149],"combinational":[10],"optimization.":[11],"Because":[12],"it":[13],"very":[15,21],"hard":[16],"for":[17,45,67],"solution,it":[19],"important":[22],"research":[25],"on":[26,32],"cryptosystem":[27],"and":[28,37,59,112,120],"number":[29],"theory.":[30],"Based":[31],"famous":[34],"two-list":[35,39],"algorithm":[36,44,74,93,128],"four-table":[40],"algorithm,a":[41],"new":[42],"adaptive":[43,92],"solution":[47,66],"of":[48,57,87,108],"proposed":[52,73,127],"by":[53],"adopting":[54],"principle":[56],"merging":[58],"four":[60],"unbalanced":[61],"sub-tables.":[62],"To":[63],"find":[64],"n":[69],"-element":[70],"problem,the":[72],"needs":[75],"O(e(2":[76],"n/?2":[77],"))":[78],"time,1\u2264e\u2264n/4":[79],",and":[80],"O(2":[81],"n/?2-e":[82],")":[83],"memory.":[84],"value":[86],"parameter":[88],"e":[89],"can":[94,129],"be":[95,136],"adjusted":[96],"range":[99],"from":[100],"1":[101],"to":[102],"n/4":[103],"accordance":[104],"with":[105],"scale":[107],"instances":[111,133],"available":[114],"computation":[115],"resource.":[116],"theoretic":[118],"analysis":[119],"computational":[122,142],"experiments":[123],"show":[124],"that":[125,134],"solve":[130],"can't":[135],"solved":[137],"before":[138],"usual":[141],"environments,thus":[143],"gaining":[144],"an":[145],"improved":[146],"result":[147],"over":[148],"past":[150],"researches.":[151]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2352476958","counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
