Доступ предоставлен для: Guest
Journal of Automation and Information Sciences

Выходит 12 номеров в год

ISSN Печать: 1064-2315

ISSN Онлайн: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

The General Reliability Network Design Problem

Том 38, Выпуск 3, 2006, pp. 34-52
DOI: 10.1615/J Automat Inf Scien.v38.i3.30
Get accessGet access

Краткое описание

We consider the important practical and theoretical problem of designing communication network with a minimum total cost to operate under condition of certain its components failing. The model with 0, 1 flow variables contains a number of constraints that is exponential in the number of nodes and we show that its LP-relaxation is NP-complete problem. For some particular cases we prove that the solution of LP-relaxation problem can be obtained by polynomial algorithm. We propose effective algorithms to compute lower and upper bounds for the two connected Steiner problem. For finding this problem solution we employ the branch and bound algorithm and we also report on some computational results.

Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain