Heuristic Algorithms for Balanced Multi-Way Number Partitioning


Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, balanced two-way number partitioning variant, whereas the most effective approximate algorithm, BLDM, may produce widely varying subset sums. In this paper, we introduce the LRM algorithm that lowers the expected spread in subset sums to one third that of BLDM for uniformly distributed numbers and odd subset cardinalities. We also propose Meld, a novel strategy for skewed number distributions. A combination of LRM and Meld leads to a heuristic technique that consistently achieves a narrower spread of subset sums than BLDM.

DOI: 10.5591/978-1-57735-516-8/IJCAI11-122

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Zhang2011HeuristicAF, title={Heuristic Algorithms for Balanced Multi-Way Number Partitioning}, author={Jilian Zhang and Kyriakos Mouratidis and HweeHwa Pang}, booktitle={IJCAI}, year={2011} }