The modified differencing method for the set partitioning problem with cardinality constraints
Discrete Applied Mathematics
The differencing algorithm LDM for partitioning: a proof of a conjecture of Karmarkar and Karp
Mathematics of Operations Research
A complete anytime algorithm for number partitioning
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Hi-index | 0.00 |
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.