на главную написать письмо карта сайта

јвтор:  Goubko M. V.
Ќазвание:  On Communication Network Topology Problem with Node Costs
—татус:  опубликовано
√од:  2013
“ип публикации:  тезисы
Ќазвание журнала или конференции:  26th European Conference on Operational Research
ѕолна€ библиографическа€ ссылка:  Goubko M. V. On Communication Network Topology Problem with Node Costs // Abstracts of 26th European Conference on Operational Research, July 1-4, 2013, Rome, Italy. P. 14.
јннотаци€:  The communication network topology problem is studied with no edge costs and node costs depending on the node degree and capacity. If cost depends on the degree only, the optimal network is shown to be the tree T of known cost. If capacity only matters, a two-layered network N is optimal where secondary nodes form a complete graph. When both degree and capacity matter, LB and UB are constructed using costs of T and N networks. A branch-and-bound procedure is designed. The local search heuristics is suggested and tested on a collection of random

ѕросмотров: 1639, загрузок: 0, за мес€ц: 0.


»ѕ” –јЌ © 2007. ¬се права защищены