Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/196222
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Иванов, Николай Николаевич | - |
dc.contributor.author | Игнатенко, Иван Иванович | - |
dc.date.accessioned | 2018-05-28T11:18:14Z | - |
dc.date.available | 2018-05-28T11:18:14Z | - |
dc.date.issued | 2001 | - |
dc.identifier.citation | Вестник Белорусского государственного университета. Сер. 1, Физика. Математика. Информатика. – 2001. - № 1. – С. 70-73. | ru |
dc.identifier.issn | 0321-0367 | - |
dc.identifier.uri | http://elib.bsu.by/handle/123456789/196222 | - |
dc.description.abstract | Cutting and packing problems appears as application both in industry, transport, manufacture, as in ensemble of domains of mathematics, physics, biology. In this article we consider a non-trim threedimensional guillotine cutting problem with two details. The rotations of details are not permitted. We don't take into account the assortiment of the details. We propose a polynomial-time algorithm for this problem. | ru |
dc.language.iso | ru | ru |
dc.publisher | Минск : БГУ | ru |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.subject | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика | ru |
dc.title | Задача безотходного гильотинного ориентированного раскроя параллелепипеда на две детали | ru |
dc.type | article | ru |
Appears in Collections: | 2001, №1 (январь) |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.