{"id":"https://openalex.org/W16404204","doi":"https://doi.org/10.1145/3184400","title":"Optimal Multi-Way Number Partitioning","display_name":"Optimal Multi-Way Number Partitioning","publication_year":2018,"publication_date":"2018-07-25","ids":{"openalex":"https://openalex.org/W16404204","doi":"https://doi.org/10.1145/3184400","mag":"16404204"},"language":"en","primary_location":{"id":"doi:10.1145/3184400","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3184400","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3184400","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3184400","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088340294","display_name":"Ethan L. Schreiber","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ethan L. Schreiber","raw_affiliation_strings":["University of California, Los Angeles, CA","University of California, Los Angeles. CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California, Los Angeles. CA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012387794","display_name":"Richard E. Korf","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard E. Korf","raw_affiliation_strings":["University of California, Los Angeles, CA","University of California, Los Angeles. CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California, Los Angeles. CA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103236778","display_name":"Michael D. Moffitt","orcid":"https://orcid.org/0000-0002-7655-5024"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael D. Moffitt","raw_affiliation_strings":["Google, Austin, Texas, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Austin, Texas, Austin, TX","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3635,"has_fulltext":true,"cited_by_count":70,"citation_normalized_percentile":{"value":0.95939204,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"65","issue":"4","first_page":"1","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.6509116291999817},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.6242440938949585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5812712907791138},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.48098886013031006},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4679642617702484},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4646323025226593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485793709754944},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4391457140445709},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4315067529678345},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4249246120452881},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42174020409584045},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4138074517250061},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.361206978559494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35876935720443726},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.3081477880477905},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2998634874820709},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23604866862297058},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.1128537654876709}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6509116291999817},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.6242440938949585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5812712907791138},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.48098886013031006},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4679642617702484},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4646323025226593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485793709754944},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4391457140445709},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4315067529678345},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4249246120452881},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42174020409584045},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4138074517250061},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.361206978559494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35876935720443726},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.3081477880477905},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2998634874820709},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23604866862297058},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.1128537654876709},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3184400","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3184400","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3184400","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt30g6n09q","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/30g6n09q","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},{"id":"pmh:qt30g6n09q","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/30g6n09q","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Schreiber, Ethan L.(2014). Optimal Multi-Way Number Partitioning. UCLA: Computer Science 0201. Retrieved from: http://www.escholarship.org/uc/item/30g6n09q","raw_type":"dissertation"}],"best_oa_location":{"id":"doi:10.1145/3184400","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3184400","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3184400","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3149677623","display_name":"RI: Large-Scale Dynamic Programming","funder_award_id":"0713178","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W16404204.pdf","grobid_xml":"https://content.openalex.org/works/W16404204.grobid-xml"},"referenced_works_count":72,"referenced_works":["https://openalex.org/W515036","https://openalex.org/W27662394","https://openalex.org/W68998088","https://openalex.org/W90587812","https://openalex.org/W91781137","https://openalex.org/W94590235","https://openalex.org/W184982708","https://openalex.org/W634463279","https://openalex.org/W1488422606","https://openalex.org/W1506378270","https://openalex.org/W1543921836","https://openalex.org/W1566860901","https://openalex.org/W1589190585","https://openalex.org/W1595545560","https://openalex.org/W1679600044","https://openalex.org/W1909318870","https://openalex.org/W1970193303","https://openalex.org/W1984481156","https://openalex.org/W1985667642","https://openalex.org/W1988937492","https://openalex.org/W1992439238","https://openalex.org/W2002575139","https://openalex.org/W2009683816","https://openalex.org/W2011039300","https://openalex.org/W2012632515","https://openalex.org/W2019133545","https://openalex.org/W2029242918","https://openalex.org/W2034990854","https://openalex.org/W2036265926","https://openalex.org/W2040513782","https://openalex.org/W2043862089","https://openalex.org/W2045492613","https://openalex.org/W2049418901","https://openalex.org/W2052841853","https://openalex.org/W2058193654","https://openalex.org/W2058200712","https://openalex.org/W2059582160","https://openalex.org/W2066671865","https://openalex.org/W2087245794","https://openalex.org/W2089269509","https://openalex.org/W2090865599","https://openalex.org/W2093188170","https://openalex.org/W2093979815","https://openalex.org/W2096053066","https://openalex.org/W2105560970","https://openalex.org/W2106287110","https://openalex.org/W2122967269","https://openalex.org/W2125412556","https://openalex.org/W2125554210","https://openalex.org/W2126160338","https://openalex.org/W2136878842","https://openalex.org/W2154930146","https://openalex.org/W2165992167","https://openalex.org/W2200803872","https://openalex.org/W2204911212","https://openalex.org/W2241927630","https://openalex.org/W2318421611","https://openalex.org/W2396275016","https://openalex.org/W2396882635","https://openalex.org/W2398806436","https://openalex.org/W2401610261","https://openalex.org/W2608239929","https://openalex.org/W2612288690","https://openalex.org/W2616464615","https://openalex.org/W2886362482","https://openalex.org/W3008429748","https://openalex.org/W3030209423","https://openalex.org/W3102962735","https://openalex.org/W4236127247","https://openalex.org/W4238573359","https://openalex.org/W4255654664","https://openalex.org/W6631455872"],"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/W2104955674","https://openalex.org/W4288260564","https://openalex.org/W2068892231","https://openalex.org/W2096053066","https://openalex.org/W2001915926"],"abstract_inverted_index":{"The":[0,31,61],"NP-hard":[1],"number-partitioning":[2,63,104],"problem":[3,65],"is":[4,29,34,59,66,79],"to":[5,26,55,180],"separate":[6],"a":[7,36,126,134],"multiset":[8],"S":[9],"of":[10,22,38,68,82,164,175,183,187],"n":[11,39,165],"positive":[12],"integers":[13,24],"into":[14,119],"k":[15,45,167],"subsets":[16],"such":[17,48],"that":[18,49,73],"the":[19,23,50,52,57,69,91,162,172,176],"largest":[20],"sum":[21],"assigned":[25],"any":[27],"subset":[28],"minimized.":[30,60],"classic":[32],"application":[33],"scheduling":[35],"set":[37],"jobs":[40],"with":[41],"different":[42],"runtimes":[43],"on":[44,95,161],"identical":[46],"machines":[47],"makespan,":[51],"elapsed":[53],"time":[54],"complete":[56],"schedule,":[58],"two-way":[62],"decision":[64],"one":[67,81,93],"original":[70],"21":[71],"problems":[72,89,105],"Richard":[74],"Karp":[75],"proved":[76],"NP-complete.":[77],"It":[78],"also":[80],"Garey":[83],"and":[84,90,137,155,166],"Johnson\u2019s":[85],"six":[86],"fundamental":[87],"NP-complete":[88],"only":[92],"based":[94],"numbers.":[96],"This":[97],"article":[98],"explores":[99],"algorithms":[100,110,159,170],"for":[101,150],"solving":[102],"multi-way":[103],"optimally.":[106],"We":[107,146],"explore":[108],"previous":[109,173],"as":[111,113],"well":[112],"our":[114],"own":[115],"algorithms,":[116],"which":[117],"fall":[118],"three":[120],"categories:":[121],"sequential":[122],"number":[123],"partitioning":[124],"(SNP),":[125],"branch-and-bound":[127],"algorithm;":[128,136],"binary-search":[129],"improved":[130],"bin":[131],"completion":[132],"(BSIBC),":[133],"bin-packing":[135],"cached":[138],"iterative":[139,143],"weakening":[140,144],"(CIW),":[141],"an":[142],"algorithm.":[145],"show":[147],"experimentally":[148],"that,":[149],"large":[151],"random":[152],"numbers,":[153],"SNP":[154],"CIW":[156],"are":[157],"state-of-the-art":[158],"depending":[160],"values":[163],".":[168],"Both":[169],"outperform":[171],"state":[174],"art":[177],"by":[178],"up":[179],"seven":[181],"orders":[182],"magnitude":[184],"in":[185],"terms":[186],"runtime.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}