title: Optimal 2D bin packing
body: <p>Given a set of rectangles of various sizes (items) and a set of rectangles of identical sizes (bins), place items into as few bins as possible.</p>
  
  <p>I'm aware of <a href="https://github.com/juj/RectangleBinPack" rel="nofollow noreferrer">A Thousand Ways to Pack the Bin</a> but I was wondering, if the number of items was suitably small and perhaps the dimensions were integers, is there a way to always pack the items optimally? Is anyone aware of a strategy or algorithm for optimal rectangle bin packing?</p>