An Efficient Dynamical Programming Algorithm for Bin Packing Problem
Résumé
In this paper, we propose a very efficient algorithm to solve the 2 dimensional bin packing problem. The algorithm can automatically place thousands of objects in bins using less than 1 minute with very near optimal results on big size instances even if orientation of the objects is free.