Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/111606
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorChentsov, A. G.en
dc.contributor.authorChentsov, P. A.en
dc.date.accessioned2022-05-12T08:19:39Z-
dc.date.available2022-05-12T08:19:39Z-
dc.date.issued2021-
dc.identifier.citationChentsov A. G. On sequential traversal of sets [Об одной задаче последовательного обхода множеств] / A. G. Chentsov, P. A. Chentsov // Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki. — 2021. — Vol. 31. — Iss. 3. — P. 487-504.en
dc.identifier.issn1994-9197-
dc.identifier.otherAll Open Access, Bronze3
dc.identifier.urihttp://elar.urfu.ru/handle/10995/111606-
dc.description.abstractThe problem of sequential traversal of megapolises with precedence conditions is investigated; this problem is oriented to mechanical engineering — CNC metal cutting machines. There is the following setting singularity: the terminal component of additive criterion contains the dependence on the starting point. This singularity leads to the fact that the natural solution procedure based on dynamic programming must be applied individually for every starting point. The investigation goal consists in the construction of an optimizing algorithm for determining a complex including a route (a variant of megapolis numbering), a trajectory, and a starting point. The proposed algorithm realizes an idea of directed enumeration of starting points. This algorithm is realized as a program for PC; computations for model examples are made. © 2021 Udmurt State University. All rights reserved.en
dc.description.sponsorshipThe study was funded by the Russian Foundation for Basic Research (project No. 20–08– 00873).en
dc.format.mimetypeapplication/pdfen
dc.language.isoruen
dc.publisherUdmurt State Universityen1
dc.publisherUdmurt State Universityen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceVestn. Udmurt. Univ., Matematika, Mekhanika, Kompyuternye Nauki2
dc.sourceVestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Naukien
dc.subjectDYNAMIC PROGRAMMINGen
dc.subjectROUTE OPTIMIZATIONen
dc.subjectSTART POINT OPTIMIZATIONen
dc.titleOn sequential traversal of setsen
dc.title.alternativeОб одной задаче последовательного обхода множествru
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.rsi46616519-
dc.identifier.doi10.35634/VM210310-
dc.identifier.scopus85117137050-
local.contributor.employeeChentsov, A.G., N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russian Federation, Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federation; Chentsov, P.A., N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russian Federation, Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federationen
local.description.firstpage487-
local.description.lastpage504-
local.issue3-
local.volume31-
dc.identifier.wos000702444500010-
local.contributor.departmentN. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russian Federation; Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federationen
local.identifier.pure23822290-
local.identifier.eid2-s2.0-85117137050-
local.fund.rffi20-08- 00873-
local.identifier.wosWOS:000702444500010-
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
2-s2.0-85117137050.pdf2,03 MBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.