|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2006, Volume 46, Number 3, Pages 395–400
(Mi zvmmf497)
|
|
|
|
Optimal location of interconnected facilities on tree networks subject to distance constraints
G. G. Zabudskii Sobolev Institute of Mathematics, Omsk Branch, Siberian Division, Russian Academy of Sciences, ul. Pevtsova 13, Omsk, 644099, Russia
Abstract:
Optimal location of interconnected facilities on tree networks is considered in the case when some of the nodes of the network contain existing facilities. The distances between the facilities must satisfy maximum constraints. Polynomial algorithms for the solution of this problem are proposed.
Key words:
tree networks, optimal location, polynomial algorithms.
Received: 13.05.2005
Citation:
G. G. Zabudskii, “Optimal location of interconnected facilities on tree networks subject to distance constraints”, Zh. Vychisl. Mat. Mat. Fiz., 46:3 (2006), 395–400; Comput. Math. Math. Phys., 46:3 (2006), 376–381
Linking options:
https://www.mathnet.ru/eng/zvmmf497 https://www.mathnet.ru/eng/zvmmf/v46/i3/p395
|
Statistics & downloads: |
Abstract page: | 288 | Full-text PDF : | 193 | References: | 51 | First page: | 1 |
|