ABSTRACT
Also, given a set of n orthogonal objects (D-dimensional parallelepipeds) with dimensions as follows:
i, .{ }w w wi i iD1 2, ,… ∈{ }n1, , The goal is to find a placement of all objects
into a minimum number of given containers under the following conditions of correct placement:
1. all edges of objects and containers are parallel; 2. all packed objects do not overlap with each
other, i.e.
