{"id":"https://openalex.org/W2045970682","doi":"https://doi.org/10.1137/s009753979834669x","title":"Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms","display_name":"Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2045970682","doi":"https://doi.org/10.1137/s009753979834669x","mag":"2045970682"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979834669x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979834669x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5100741513","display_name":"Chengbin Chu","orcid":"https://orcid.org/0000-0002-1837-4380"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chengbin Chu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110106782","display_name":"R\u00e9my La","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R\u00e9my La","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":0.0,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.19274919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"6","first_page":"2069","last_page":"2083"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9984999895095825,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9779000282287598,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7945632934570312},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6289221048355103},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5546431541442871},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4837360680103302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4744081199169159},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.47027426958084106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4691076874732971},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.45131611824035645},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.43999969959259033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3732416033744812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3520899713039398}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7945632934570312},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6289221048355103},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5546431541442871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4837360680103302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4744081199169159},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.47027426958084106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4691076874732971},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.45131611824035645},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.43999969959259033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3732416033744812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3520899713039398},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s009753979834669x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979834669x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W103094345","https://openalex.org/W1497362616","https://openalex.org/W1519941054","https://openalex.org/W1967335485","https://openalex.org/W1981964469","https://openalex.org/W2006671706","https://openalex.org/W2012058818","https://openalex.org/W2018816426","https://openalex.org/W2025787252","https://openalex.org/W2032522336","https://openalex.org/W2048628062","https://openalex.org/W2048905935","https://openalex.org/W2052064586","https://openalex.org/W2056716554","https://openalex.org/W2086102640","https://openalex.org/W2102978292","https://openalex.org/W4255333061"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W2104955674","https://openalex.org/W2001915926","https://openalex.org/W2068892231"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"a":[5,19,74,84],"one-dimensional":[6],"bin":[7,21,27],"packing":[8,22],"problem":[9,40,63],"where":[10],"the":[11,26,30,34,46],"bins":[12],"do":[13],"not":[14],"have":[15],"identical":[16,38],"sizes,":[17],"or":[18,56],"variable-sized":[20],"problem,":[23],"to":[24],"minimize":[25],"consumption,":[28],"i.e.,":[29],"total":[31],"size":[32,39],"of":[33],"opened":[35],"bins.":[36],"The":[37,54,121],"has":[41,59],"been":[42,60],"extensively":[43],"studied":[44],"in":[45,67],"literature":[47],"both":[48],"for":[49,127,132,137],"static":[50],"and":[51,108,129,134],"dynamic":[52],"settings.":[53],"worst-case":[55,117,144],"average-case":[57],"performance":[58],"analyzed.":[61,120],"Our":[62],"setting":[64],"particularly":[65],"arises":[66],"metal":[68],"cutting":[69],"industries.":[70],"Therefore,":[71],"it":[72],"presents":[73],"great":[75],"practical":[76],"relevance.":[77],"Four":[78],"greedy":[79],"approximation":[80],"algorithms":[81],"based":[82],"on":[83],"construction":[85],"approach":[86],"called":[87],"largest":[88,96],"object":[89,97],"first":[90,98],"with":[91,99],"least":[92,100,104,109],"absolute":[93,105,116],"waste":[94,102,106,111],"(LFLAW),":[95],"relative":[101,110],"(LFLRW),":[103],"(LAW),":[107],"(LRW)":[112],"are":[113,119,125,146],"examined.":[114],"Their":[115],"performances":[118],"worst":[122],"case":[123],"bounds":[124,145],"2":[126,136],"LFLAW":[128],"LFLRW,":[130],"3":[131],"LAW,":[133],"2+ln":[135],"LRW.":[138],"We":[139],"also":[140],"show":[141],"that":[142],"these":[143],"tight.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}