has anybody succesfully managed to write an algorithm to minimize the packing used? In this case a set of items has to be put in the least number of boxes and the smallest boxes possible. So far I have found only 'brute force' options that simply try out the six possible orientations for each and every item, resulting in thousands of calculations for just a handfull of items.