title: Python Implementations of Packing Algorithm
body: <p>For an application I'm working on I need something like a packing algorithm implemented in Python <a href="http://en.wikipedia.org/wiki/Packing_problem" rel="noreferrer">see here for more details</a>.  The basic idea is that I have <em>n</em> objects of varying sizes that I need to fit into <em>n</em> bins, where the number of bins is limited and the size of both objects and bins is fixed.  The objects / bins can be either 1d or 2d, interested in seeing both.  (I think 3d objects is probably more than I need.)  </p>
  
  <p>I know there are a variety of algorithms out there that address this problem, such asBest Fit Decreasing and First Fit Decreasing, but I was hoping there might be an implementation in Python (or PHP/C++/Java, really I'm not that picky).  Any ideas?</p>