How to sort a list of floats into two groups that are optimized such that the difference between the sum of each group is minimized?

Question

Assume I have a list of floats of the form:

list = [a, b, c, d, e, f, ...]

I would like to sort the elements into two lists (list_1 and list_