How to classify/group the elements of a number series so that the sum of the elements in each group is approximately the same?

Question

Mathematics

There is a number series: 2717, 1995, 1633, 1244, 978, 745, 588 (there are many more numbers).

It is necessary to divide these numbers into groups so that the sum of the elements of the group is as equal as possible.
The number of groups is given (not a constant).

Answer 1

This is the optimal subsetting problem and is NP-hard. There is no simple and fast algorithm here.
Full enumeration, branch and bound method, all sorts of annealing methods and genetic algorithms to help you.
In some cases (the sum is not very large and there are only 2 sets; the numbers are very small) fast algorithms based on dynamic programming are possible