title: Splitting n weighted objects in m disjoint sets such that maximum of sum of objects in a all sets is minimal
body: <p>Suppose that there are n objects with different weights. We need to divide all objects in m sets.  Let S<sub>i</sub> be sum of i<sup>th</sup> set, 1&lt;= i &lt;=m. S<sub>max</sub> be maximum of all S<sub>i</sub>'s. What can be the algorithm to minimize S<sub>max</sub> over all possible divisions of n objects in m sets.</p>
  
  <p>I have seen some algo which used Hungarian algorithm and bipartite graphs but could not understand that.</p>