January 31, 2003
Author(s)
April Andreas, Isabel M. Beichl
For a given set of numbers, the integer partitioning problem is to divide the numbers into two groups, so that the sums of the numbers in each group differ by the smallest amount possible. In a balanced perfect partition, the sums differ by only zero or