To the application of two-stage dynamic programming in the problem of sequential visiting of megalopolises

Chentsov, A. G.; Chentsov, P. A.

doi:10.1016/j.prostr.2022.04.013

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/118149

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Chentsov, A. G.	en
dc.contributor.author	Chentsov, P. A.	en
dc.date.accessioned	2022-10-19T05:22:55Z	-
dc.date.available	2022-10-19T05:22:55Z	-
dc.date.issued	2021	-
dc.identifier.citation	Chentsov A. G. To the application of two-stage dynamic programming in the problem of sequential visiting of megalopolises / A. G. Chentsov, P. A. Chentsov // Procedia Structural Integrity. — 2021. — Vol. 40. — Iss. C. — P. 105-111.	en
dc.identifier.issn	24523216	-
dc.identifier.other	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132199552&doi=10.1016%2fj.prostr.2022.04.013&partnerID=40&md5=e2b64b9185584f609ab7b5939db280a2	link
dc.identifier.uri	http://elar.urfu.ru/handle/10995/118149	-
dc.description.abstract	It is considered the routing problem solution in which the task set is the union of two subsets (zones); one of subsets should be serviced earlier than the second. It is supposed that each task is connected with the visit to a megalopolis (nonempty finite set) and fulfilment of works. The regular succession of task fulfilment should satisfy to precedence conditions realized in each of zones. The cost functions assume a task list dependence; cost aggregation is supposed additive. For solution, the two-stage dynamic programming procedure is used. © 2021 Elsevier B.V.. All rights reserved.	en
dc.format.mimetype	application/pdf	en
dc.language.iso	en	en
dc.publisher	Elsevier B.V.	en
dc.rights	info:eu-repo/semantics/openAccess	en
dc.source	Procedia Structural Integrity	en
dc.subject	DYNAMIC PROGRAMMING	en
dc.subject	PRECEDENCE CONDITIONS	en
dc.subject	ROUTING PROBLEM	en
dc.subject	SHEET CUTTING	en
dc.title	To the application of two-stage dynamic programming in the problem of sequential visiting of megalopolises	en
dc.type	Conference Paper	en
dc.type	info:eu-repo/semantics/conferenceObject	en
dc.type	info:eu-repo/semantics/publishedVersion	en
dc.conference.name	15th International Conference on Mechanics, Resource and Diagnostics of Materials and Structures, MRDMS 2021	en
dc.conference.date	20 December 2021 through 24 December 2021	-
dc.identifier.doi	10.1016/j.prostr.2022.04.013	-
dc.identifier.scopus	85132199552	-
local.contributor.employee	Chentsov, A.G., Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russian Federation, Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federation	en
local.contributor.employee	Chentsov, P.A., Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russian Federation, Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federation	en
local.description.firstpage	105	-
local.description.lastpage	111	-
local.issue	C	-
local.volume	40	-
local.contributor.department	Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russian Federation	en
local.contributor.department	Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federation	en
local.identifier.pure	30456787	-
local.identifier.eid	2-s2.0-85132199552	-
Располагается в коллекциях:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:

Файл	Описание	Размер	Формат
2-s2.0-85132199552.pdf		561,64 kB	Adobe PDF	Просмотреть/Открыть

Показать базовое описание ресурса Статистика Google Scholar

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