An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums

Abstract

To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add up to the same sum.

arXiv comment12 pages