Please use this identifier to cite or link to this item:
http://repositsc.nuczu.edu.ua/handle/123456789/1830| Title: | A study of ellipse packing in the high-dimensionality problems |
| Authors: | Данілін О.М. Комяк В.В. Комяк В.М. |
| Issue Date: | 2017 |
| Description: | The cutting and packing problems, also known as the problems of optimum allocation [1, 2], are the study subject in computational geometry and methods of their solution represent the new trend in the operations research theory. This class of problems has a wide range of scientific and practical applications. The class of problems connected with packing of given ellipse sets into a rectangular region of minimum dimensions is considered. Such problems arise in powder metallurgy when movement of loose substances is modeled and in logistics when modeling optimum packs of cylindrical objects with elliptic bases. |
| URI: | http://repositsc.nuczu.edu.ua/handle/123456789/1830 |
| ISSN: | 1729-3774 |
| Appears in Collections: | Кафедра наглядово-профілактичної діяльності |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Наша_статья.pdf | Information in article | 366,84 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.