Analysis of dominating subset with minimal weight problem
Yükleniyor...
Tarih
2011
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Selcuk University Research Center of Applied Mathematics
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The paper deals with the analysis of the combinatorial problem "dominating subset with minimal weight" problem that is equivalent to a subproblem in the cutting angle method which has been developed for solving a broad class of global optimization problems. An example is given for a more clear expression of the problem and its presentation is supported by simple graph notation. Then the complexity of the problem is discussed. It is proven that the problem is strongly NP-Complete by using the weighted set covering problem. Finally analysis of dominating subset with minimal weight problem is expressed for problems in small dimensions.
Açıklama
URL: http://sjam.selcuk.edu.tr/sjam/article/view/278
Anahtar Kelimeler
Combinatorial optimization, Set covering problem, Weighted set covering problem, Kombinatoryal optimizasyon, Kaplama problemini ayarlama, Ağırlıklı set kaplama problemi
Kaynak
Selcuk Journal of Applied Mathematics
WoS Q Değeri
Scopus Q Değeri
Cilt
12
Sayı
Künye
Ordin, B., Nuriyeva, F. (2011). Analysis of dominating subset with minimal weight problem. Selcuk Journal of Applied Mathematics, 12 (1), 43-52.
