title: Bin Packing: Set amount on bins, want to minimize the max bin weight
body: <p>Given <em>n</em> bins of infinite capacity, I want to pack <em>m</em> items into them (each with a specific weight), whilst minimizing the weight of the heaviest bin.</p>
  
  <p>This isn't a traditional bin packing / knapsack problem where a bin has a finite capacity and you attempt to minimize the amount of bins used; I have a set amount of bins and want to use them all in order to make the heaviest bin's weight as low as possible.</p>
  
  <p>Is there a name for this problem? I have looked through a number of papers with key words, but I have found nothing similar.</p>
  
  <p>Cheers.</p>