Given a box of given size LxMxN$L\times M\times N$ and a list of smaller boxes of given sizes (l_i,m_i,n_i)$(l_i,m_i,n_i)$, decide whether the smaller boxes altogether fit into the big box (and produce such a packing if possible).
The problem is NP-complete...so I am looking for a good heuristic algorithm...the algorithm should allow for (the obvious possible) rotations of the boxes.
What are currently good/best heuristic algorithms and codes? Links to papers or webpages are also welcome.
