Last modified: 2021-04-15

#### Abstract

#### Keywords

#### References

1. G.N, Verkhoturova, R. R. Yagudin. The solution of aproblem of dense packing of convex polyhedronswith application of a godograf of function of denseplacement / G.N, Verkhoturova, R.R. Yagudin’Decision making under uncertainty: Vol. 6. Ufa:USATU, 2009. - P. 173-179.

2. G. N. Verkhoturova, M. A. Verkhoturova, R. R.‘Yagudin. Fast algorithm of search of crossing of twoconvex polyhedrons / G. N. Verkhoturova, M. A.Verkhoturova, R. R. Yagudin// Decision-making inthe conditions of uncertainty: interhigher educationinstitution, Ufa: YTATY, 2010. —P, 102-108.

3. Yu.G. Stoyan, Yakovlev S. V. Mathematical modelsand optimizing methods of geometrical design. -Kiev.: Sciences, 1986. ~286p.

4. Y. G, Stoyan, N.I. Gil, G. Scheithauer, A. Pankratov,1. Magdalina, Packing of convex polytopes intoa parallelepiped. Optimization, 54 (2) : 215-235, 2005.