I'm trying to approximately solve a 3D container loading problem. Is it possible to use 2D bin packing algorithms? If so, how do we make the transformation? What are the conditions needed to make the transformation?


1 Answer 1


According to the attached file:

In the $m$-dimensional bin packing problem ($m$-BPP) there are many large boxes of equal sizes, which are called bins, and the objective is to pack all $n$ items into a minimum number of bins.

We can translate any $m$-BPP instance into an instance of $(m+1)$-SPP (strip packing problem), where the additional $(m+1)$st direction (the height of the strip) is used to count bins.

I hope, this link would be useful.


Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.