title: The box stacking algorithm
body: <p>I have a question about the box stacking algorithm that was suggested here:
  <a href="http://people.csail.mit.edu/bdean/6.046/dp/" rel="nofollow">http://people.csail.mit.edu/bdean/6.046/dp/</a></p>
  
  <p>The algorithm making some wrong assumption:
  In the video, it says that we "sort the boxes in order of decresing base area...etc".
  We do it because A box can be placed on top of another box only if both width and depth of the upper placed box are smaller than width and depth of the lower box respectively.
  but if box B_1 has a base area that is bigger the box B_2, that doesn't mean that it also has its width and depth bigger than the width and depth of box B_2.</p>
  
  <p>for example, a box with a 1x8 base dimensions has a bigger base area than a box with a 2x3 dimensions, but still: 1&lt;2 (and 1&lt;3), and therefor we cannot stack box B_2 onto B_1.
  what am I missing here?</p>