title: Knapsack with multiple bags and items having only weight
body: <p>I am trying to solve this problem and I wanted to know if there are known existing algorithms / solutions to solve this.</p>
  
  <p>Problem:</p>
  
  <blockquote>
    <p>I have n bags and n items (which are either equal or different weights) to fill into these bag. Each of these bags have a certain weight limit and the n items needs to be put into these bags in such a way that I can use the maximum space in each of these bags.</p>
  </blockquote>
  
  <p>The bags are of equal size. Will also like to know how to solve with bags of unequal size too.</p>
  
  <p>Most of the solutions I read was trying to solve a 0/1 knapsack with a weight and value. Should I consider the weight and value as same? Am I on the right track?</p>
  
  <p>This is not a homework problem.</p>