{"id":"https://openalex.org/W221129011","doi":null,"title":"An Efficient Algorithm for the Generalized Continuous Multiple Choice linear Knapsack Problem","display_name":"An Efficient Algorithm for the Generalized Continuous Multiple Choice linear Knapsack Problem","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W221129011","mag":"221129011"},"language":"en","primary_location":{"id":"mag:221129011","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=SGHHB1_1997_v23n4_661","pdf_url":null,"source":{"id":"https://openalex.org/S4306515762","display_name":"Journal of Korean Institute of Industrial Engineers","issn_l":"1225-0988","issn":["1225-0988","2234-6457"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-excellent"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Korean Institute of Industrial Engineers","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/A5109172314","display_name":"Joong-Yeon Won","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joong-Yeon Won","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109172314"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"4","first_page":"661","last_page":"667"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9643999934196472,"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.9643999934196472,"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.011500000022351742,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.011099999770522118,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.9269999861717224},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9639999866485596},{"id":"https://openalex.org/keywords/binary-search","display_name":"binary search","score":0.7580000162124634},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6880000233650208},{"id":"https://openalex.org/keywords/efficient-algorithms","display_name":"efficient algorithms","score":0.6169999837875366}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9627645015716553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7858096361160278},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7339681386947632},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6526060104370117},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.617293655872345},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5549290776252747},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5015418529510498},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4871096611022949},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45304253697395325},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4501202702522278},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42607229948043823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4180958569049835},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4101962149143219},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:221129011","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=SGHHB1_1997_v23n4_661","pdf_url":null,"source":{"id":"https://openalex.org/S4306515762","display_name":"Journal of Korean Institute of Industrial Engineers","issn_l":"1225-0988","issn":["1225-0988","2234-6457"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-excellent"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Korean Institute of Industrial Engineers","raw_type":null},{"id":"mag:2216354427","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Article/NODE01914981","pdf_url":null,"source":{"id":"https://openalex.org/S4306515762","display_name":"Journal of Korean Institute of Industrial Engineers","issn_l":"1225-0988","issn":["1225-0988","2234-6457"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-excellent"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0","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/W783357368","https://openalex.org/W2135814502","https://openalex.org/W2155737905","https://openalex.org/W845163458","https://openalex.org/W2265518413","https://openalex.org/W2320904627","https://openalex.org/W904125360","https://openalex.org/W2157513965","https://openalex.org/W2045247420","https://openalex.org/W2000799125"],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2],"generalized":[3,34,44],"problem":[4,11,40,50],"of":[5,18,78,102],"the":[6,15,19,26,33,43,65,99],"continuous":[7,45,60],"multiple":[8,46,61],"choice":[9,47,62],"knapsack":[10,49],"and":[12,28,51,64,88],"study":[13],"on":[14],"LP":[16,37],"relaxation":[17],"candidate":[20,39],"problems":[21],"which":[22,56,67],"are":[23,57],"generated":[24],"in":[25],"branch":[27],"bound":[29,73],"algorithm":[30,77],"for":[31],"solving":[32],"problem.":[35],"The":[36],"relaxed":[38],"is":[41,81,98,107],"called":[42],"linear":[48],"characterized":[52],"by":[53,83],"some":[54,85],"variables":[55],"partitioned":[58],"into":[59],"constraints":[63],"others":[66],"only":[68],"belong":[69],"to":[70,92],"simple":[71],"upper":[72],"constraints.":[74],"An":[75],"efficient":[76],"order":[79],"O()":[80],"developed":[82],"exploiting":[84],"structural":[86],"properties":[87],"applying":[89],"binary":[90],"search":[91],"ordered":[93],"solution":[94],"sets,":[95],"where":[96],"n":[97],"total":[100],"number":[101],"variables.":[103],"A":[104],"numerical":[105],"example":[106],"presented.":[108]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}