{"id":"https://openalex.org/W2021469991","doi":"https://doi.org/10.1142/s0129053397000027","title":"A Cost Optimal Search Technique for the Knapsack Problem","display_name":"A Cost Optimal Search Technique for the Knapsack Problem","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2021469991","doi":"https://doi.org/10.1142/s0129053397000027","mag":"2021469991"},"language":"en","primary_location":{"id":"doi:10.1142/s0129053397000027","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053397000027","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","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/A5017883735","display_name":"Der\u2010Chyuan Lou","orcid":"https://orcid.org/0000-0001-6697-7648"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Der-Chyuan Lou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038550838","display_name":"Chin\u2010Chen Chang","orcid":"https://orcid.org/0000-0002-7319-5780"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chin-Chen Chang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2876,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.86453202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"09","issue":"01","first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"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.9988999962806702,"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.996399998664856,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9853000044822693,"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":0.9172695875167847},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7661479115486145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5836632251739502},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4918072521686554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43731069564819336}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9172695875167847},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7661479115486145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5836632251739502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4918072521686554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43731069564819336}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129053397000027","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053397000027","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","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":0,"referenced_works":[],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842","https://openalex.org/W2089402478","https://openalex.org/W862610577"],"abstract_inverted_index":{"The":[0],"knapsack":[1,25,77],"problem":[2,26,57,78],"is":[3,37,90,133,150,168,183],"known":[4],"to":[5,16,50,74,101,116,141,171],"be":[6,28,117],"a":[7,20,66,97],"typical":[8],"NP-complete":[9],"problem,":[10],"which":[11,70],"has":[12,45],"2n":[13,31],"possible":[14],"solutions":[15],"search":[17,36,99,109,139,166],"over.":[18],"Thus":[19],"task":[21],"for":[22],"solving":[23],"the":[24,40,52,76,84,108,120,126,129,142,145,159,172,187],"can":[27],"accomplished":[29],"in":[30,48,79],"trials":[32],"if":[33],"an":[34],"exhaustive":[35,60],"applied.":[38],"In":[39,62,92],"past":[41],"decade,":[42],"much":[43],"effort":[44],"been":[46],"devoted":[47],"order":[49],"reduce":[51],"computation":[53],"time":[54,110],"of":[55,59,86,112,128,147],"this":[56,93,138],"instead":[58],"search.":[61],"1984,":[63],"Karnin":[64],"proposed":[65,130,174,180],"brilliant":[67],"parallel":[68,88,104,114,131,181],"algorithm,":[69],"needs":[71],"O(2n/6)":[72,122],"processors":[73,123,149],"solve":[75],"O(2n/2)":[80],"time;":[81],"that":[82,144,164],"is,":[83],"cost":[85,127],"Karnin's":[87,103,113],"algorithm":[89,105,115,132,182],"O(22n/3).":[91],"paper,":[94],"we":[95,136,162],"propose":[96],"fast":[98],"technique":[100,140,167],"improve":[102],"by":[106],"reducing":[107],"complexity":[111],"O(2n/3)":[118],"under":[119],"same":[121],"available.":[124],"Thus,":[125],"O(2n/2).":[134],"Furthermore,":[135],"extend":[137],"case":[143],"number":[146],"available":[148],"P":[151],"=":[152],"O(2x),":[153],"where":[154],"x":[155],"\u2265":[156],"1.":[157],"From":[158],"analytical":[160],"results,":[161],"see":[163],"our":[165,179],"indeed":[169],"superior":[170],"previously":[173],"methods.":[175],"We":[176],"do":[177],"believe":[178],"pragmatically":[184],"feasible":[185],"at":[186],"moment":[188],"when":[189],"multiprocessor":[190],"systems":[191],"become":[192],"more":[193,195],"and":[194],"popular.":[196]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}