title: Knapsack / Bin Packing Problem with a twist?
body: <p>So, I've been searching far and wide and I'm still not sure what the correct classification of the problem that I'm dealing with is, so I can't really search for solutions to it.</p>
  <p>I have x amount of different objects (of which I know their H/W/L) and I want to fit them into boxes, but I don't want to fit as many in one box as possible, one object goes into one box.
  I want to decide on how many different sizes of boxes I would need to fit those objects into them, while also minimizing the amount of different sized boxes.
  One thing that makes the problem a little easier is that the width and height of the objects are the same for all objects, so length is the only issue.</p>
  <p>To give a more practical idea of what my use case would be, the problem at hand is how does a company determine, which different box sizes they should have in order to fit all their different products into them, without having unnecessarily many different box sizes.</p>
  <p>Example: I have an object that has a length of 1200 mm and another one that has a length of 1150 mm, both share the same width and height. Since the difference in length is so small, it would make sense to not have an extra box size just for that 1150 mm object and use the same box for both.</p>
  <p>My idea to solve the problem was to cluster the objects using an algorithm and playing around with the number or the center of clusters.</p>
  <p>What type of problem am I looking at and what type of algorithm would be best to cluster my objects?</p>