Algorithm for calculating the minimum volume

Question

Mathematics

Khabrovchan tell me the algorithm for calculating the minimum volume of packaging, taking into account that I have n items of different sizes.

Answer 1

In general, the minimum volume of packaging is equal to the sum of the volumes of items that need to be placed in the package)) There is no task context. Or you need to calculate the length, width and height of the package, which would fit all the items. Most likely this is the issue. Explain

Answer 2

I think it will be interesting habrahabr.ru/post/136225/

Answer 3

en.wikipedia.org/wiki/Problem_of_packing_in_to_containers
Well, or start with a volume equal to the sum and try to pack until it fits, increasing the volume.

Answer 4

Do the shape and dimensions of the packaging side matter or can they be arbitrary?

Answer 5

I think that you will not find a ready-made algorithm right off the bat. As you have already been pointed out, you need to look at the problems of two-dimensional packing and generalize them for yourself, and then solve them with some kind of local descent or simulated annealing.