Splitting n weighted objects in m disjoint sets such that maximum of sum of objects in a all sets is minimum

See more:

algorithm

Suppose that there are n objects with different weights and these n values and m are only parameters we are supplied. We need to divide all objects in m sets. Let Si be sum of ith set, 1<= i <=m. Smax be maximum of all Si's. What can be the algorithm to minimize Smax over all possible divisions of n objects in m sets.

I have seen some algo which used Hungarian algorithm and bipartite graphs but could not understand that.