Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/196222
Full metadata record
DC FieldValueLanguage
dc.contributor.authorИванов, Николай Николаевич-
dc.contributor.authorИгнатенко, Иван Иванович-
dc.date.accessioned2018-05-28T11:18:14Z-
dc.date.available2018-05-28T11:18:14Z-
dc.date.issued2001-
dc.identifier.citationВестник Белорусского государственного университета. Сер. 1, Физика. Математика. Информатика. – 2001. - № 1. – С. 70-73.ru
dc.identifier.issn0321-0367-
dc.identifier.urihttp://elib.bsu.by/handle/123456789/196222-
dc.description.abstractCutting 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 three­dimensional 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.isoruru
dc.publisherМинск : БГУru
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математикаru
dc.titleЗадача безотходного гильотинного ориентированного раскроя параллелепипеда на две деталиru
dc.typearticleru
Appears in Collections:2001, №1 (январь)

Files in This Item:
File Description SizeFormat 
70-73.pdf2,8 MBAdobe PDFView/Open
Show simple item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.