{"id":"https://openalex.org/W2009408467","doi":"https://doi.org/10.1137/0404007","title":"Analysis of a Compound Bin Packing Algorithm","display_name":"Analysis of a Compound Bin Packing Algorithm","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W2009408467","doi":"https://doi.org/10.1137/0404007","mag":"2009408467"},"language":"en","primary_location":{"id":"doi:10.1137/0404007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0404007","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5059076709","display_name":"Donald K. Friesen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Donald K. Friesen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael A. Langston","orcid":"https://orcid.org/0000-0001-5945-5796"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael A. Langston","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.19136504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":"1","first_page":"61","last_page":"79"},"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.9968000054359436,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9945999979972839,"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.9327154755592346},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7712830305099487},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7266336679458618},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7035958170890808},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6967453360557556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5635590553283691},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.5593621730804443},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4816688299179077},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4766560196876526},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46345776319503784},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39657723903656006},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2720547914505005}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9327154755592346},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7712830305099487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7266336679458618},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7035958170890808},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6967453360557556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5635590553283691},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.5593621730804443},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4816688299179077},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4766560196876526},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46345776319503784},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39657723903656006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2720547914505005},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0404007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0404007","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.5192","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.5192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://cs.utk.edu/pub/TechReports/1989/ut-cs-89-95.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2004690405","https://openalex.org/W2005908084","https://openalex.org/W2025819959","https://openalex.org/W2048241500","https://openalex.org/W2123068254","https://openalex.org/W2143987816","https://openalex.org/W2145028977"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W138116057","https://openalex.org/W4255148175","https://openalex.org/W2161940019","https://openalex.org/W2001915926","https://openalex.org/W2096053066","https://openalex.org/W2104955674","https://openalex.org/W2971368033","https://openalex.org/W2949755993"],"abstract_inverted_index":{"Consider":[0],"the":[1,17,34,68,91,105],"classic":[2],"bin":[3,29],"packing":[4,30,36],"problem,":[5],"in":[6],"which":[7,95],"we":[8],"seek":[9],"to":[10,82,90],"pack":[11],"a":[12,27],"list":[13],"of":[14,20,26,71,108],"items":[15],"into":[16],"minimum":[18],"number":[19,70,107],"unit-capacity":[21],"bins.":[22,109],"The":[23],"worst-case":[24],"performance":[25],"compound":[28,86],"algorithm":[31,87],"that":[32,84],"selects":[33],"better":[35],"produced":[37],"by":[38],"two":[39,51],"previously":[40],"analyzed":[41],"heuristics,":[42],"namely,":[43],"FFD":[44,55],"(first":[45],"fit":[46],"decreasing)":[47],"and":[48,56,65],"B2F":[49,57],"(best":[50],"fit)":[52],"is":[53,80,88,97],"investigated.":[54],"can":[58],"asymptotically":[59],"require":[60],"as":[61,63],"many":[62],"$\\frac{11}{9}$":[64],"$\\frac{5}{4}$":[66],"times":[67,104],"optimal":[69,106],"bins,":[72],"respectively.":[73],"A":[74],"new":[75],"technique,":[76],"weighting":[77],"function":[78],"averaging,":[79],"introduced":[81],"prove":[83],"our":[85],"superior":[89],"individual":[92],"heuristics":[93],"on":[94],"it":[96],"based,":[98],"never":[99],"using":[100],"more":[101],"than":[102],"$\\frac{6}{5}$":[103]},"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":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}