{"id":"https://openalex.org/W2021499426","doi":"https://doi.org/10.1016/0167-6377(93)90072-o","title":"Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems","display_name":"Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W2021499426","doi":"https://doi.org/10.1016/0167-6377(93)90072-o","mag":"2021499426"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(93)90072-o","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(93)90072-o","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5103348954","display_name":"Tsung-Chyan Lai","orcid":null},"institutions":[{"id":"https://openalex.org/I43566213","display_name":"National Taipei University of Business","ror":"https://ror.org/029hrv109","country_code":"TW","type":"education","lineage":["https://openalex.org/I43566213"]},{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Tsung-Chyan Lai","raw_affiliation_strings":["Department of Industrial and Business Administration, College of Management, National Taiwan University, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Business Administration, College of Management, National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I43566213","https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103348954"],"corresponding_institution_ids":["https://openalex.org/I16733864","https://openalex.org/I43566213"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":2.1146,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86153634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"4","first_page":"215","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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.9984999895095825,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.8100055456161499},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7888819575309753},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.675133228302002},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.6725165247917175},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6126437187194824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6091105341911316},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4817483425140381},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4695976972579956},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.42562809586524963},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3436221480369568}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8100055456161499},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7888819575309753},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.675133228302002},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.6725165247917175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6126437187194824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6091105341911316},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4817483425140381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4695976972579956},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.42562809586524963},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3436221480369568}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-6377(93)90072-o","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(93)90072-o","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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":6,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2016357237","https://openalex.org/W2031061043","https://openalex.org/W2066356146","https://openalex.org/W2401610261","https://openalex.org/W4236384091"],"related_works":["https://openalex.org/W2393014972","https://openalex.org/W2357796514","https://openalex.org/W2357595179","https://openalex.org/W3171554204","https://openalex.org/W3199776955","https://openalex.org/W1990489976","https://openalex.org/W2373750984","https://openalex.org/W2351136238","https://openalex.org/W2169800510","https://openalex.org/W2167807475"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}