2
$\begingroup$

I have many 3D boxes. All boxes are rectangular cuboids (they can rotate 90° so dimensions are interchangeable). The goal is to pack those boxes one into each other to minimize occupied space. There is no limit how deep boxes can be nested into each other. Single box can have multiple smaller boxes inside, and they can overlap. I've searched for "bin packing problem" and "container loading problem" but both of them include just single layer of nesting. Do you know any algorithms/approaches/literature/academic papers or other keywords that could help me?

$\endgroup$
1
  • 1
    $\begingroup$ "and they can overlap" Can you elaborate on this? $\endgroup$
    – orlp
    Mar 11 at 21:46

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.