{"id":"https://openalex.org/W2391817072","doi":null,"title":"On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem","display_name":"On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2391817072","mag":"2391817072"},"language":"en","primary_location":{"id":"mag:2391817072","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-WZSF200801002.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764998085","display_name":"Journal of Wenzhou University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4366305942","host_organization_name":"Wenzhou University","host_organization_lineage":["https://openalex.org/P4366305942"],"host_organization_lineage_names":["Wenzhou University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Wenzhou University","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/A5067943900","display_name":"FU Yong-jun","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3133134087","display_name":"Lanzhou Jiaotong University","ror":"https://ror.org/03144pv92","country_code":"CN","type":"education","lineage":["https://openalex.org/I3133134087"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"FU Yong-jun","raw_affiliation_strings":["School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, China, 730070"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, China, 730070","institution_ids":["https://openalex.org/I3133134087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067943900"],"corresponding_institution_ids":["https://openalex.org/I3133134087"],"apc_list":null,"apc_paid":null,"fwci":0.7985,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.836928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"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.9980000257492065,"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.9980000257492065,"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.000699999975040555,"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.0005000000237487257,"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/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":1.0},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9490000009536743},{"id":"https://openalex.org/keywords/mathematical-model","display_name":"mathematical model","score":0.5960000157356262},{"id":"https://openalex.org/keywords/greedy-algorithm-comparison","display_name":"greedy algorithm comparison","score":0.7599999904632568}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9878760576248169},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8761571645736694},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.7451698780059814},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.6222782135009766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6137231588363647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.596901535987854},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5668520927429199},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5540675520896912},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5519973039627075},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5126928091049194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4542050063610077},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44926097989082336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44765129685401917},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26144343614578247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08911970257759094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2391817072","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-WZSF200801002.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764998085","display_name":"Journal of Wenzhou University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4366305942","host_organization_name":"Wenzhou University","host_organization_lineage":["https://openalex.org/P4366305942"],"host_organization_lineage_names":["Wenzhou University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Wenzhou University","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2362749956","https://openalex.org/W1981434190","https://openalex.org/W2349422245","https://openalex.org/W2374538697","https://openalex.org/W2381142394","https://openalex.org/W3006294151","https://openalex.org/W2759379324","https://openalex.org/W2045492613","https://openalex.org/W2361621085","https://openalex.org/W2017316844"],"abstract_inverted_index":{"With":[0],"0-1":[1,19,54],"knapsack":[2,20,55],"problem":[3,21,56],"being":[4],"research":[5],"object,this":[6],"paper":[7],"has":[8],"set":[9],"up":[10],"a":[11],"mathematical":[12],"model":[13],"for":[14,22,36,52,57],"0-1knapsack":[15],"problem.Planning":[16],"to":[17,62,71],"solve":[18],"medium-sized":[23],"and":[24,34,50,59],"small":[25,60],"scale":[26],"by":[27],"the":[28,37,43],"sequential":[29,44],"combination":[30,45],"tree":[31,46],"algorithm,through":[32],"analysis":[33],"computation":[35],"concrete":[38],"example,it":[39],"is":[40,48,68],"proved":[41],"that":[42],"algorithm":[47],"feasible":[49],"effective":[51],"solving":[53],"medium":[58],"scale,compared":[61],"traditional":[63],"greedy":[64],"algorithm,the":[65],"optimal":[66],"solution":[67],"very":[69],"easy":[70],"be":[72],"found.":[73]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}