Given a multiset of numbers $X = \{x_1, \dots, x_n\}$, such that $\sum X = 0$, how can $X$ be partitioned to the maximum number of subsets so that each subset sums to zero?
I have searched around a lot, but none of the partition or packing problem variants seem to address this particular case.