{"type":"ScholarlyArticle","title":"A Hybrid Recursive Multi-Way Number Partitioning Algorithm","authors":[{"name":"Richard E. Korf","slug":"richard-e-korf","given":"Richard E.","family":"Korf","affiliation":""}],"abstract":"The number partitioning problem is to divide a given set of N positive integers into K subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While effective algorithms for two-way partitioning exist, multi-way partitioning is much more challenging. We introduce an improved algorithm for optimal multi-way partitioning, by combining several existing algorithms with some new extensions. We test our algorithm for partitioning 31-bit integers from three to ten ways, and demonstrate orders of magnitude speedup over the previous state of the art.","doi":"10.5591/978-1-57735-516-8/IJCAI11-106","url":"https://ijcai.org/proceedings/2011/106","pdf":"https://ijcai.org/proceedings/2011/0106.pdf","markdown":"https://ijcai.org/proceedings/2011/106.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/106","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":106,"pages":{"first":591,"last":595},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}