Analysis of dominating subset with minimal weight problem

dc.contributor.author	Ordin, Burak
dc.contributor.author	Nuriyeva, Fidan
dc.date.accessioned	2018-05-03T07:18:37Z
dc.date.available	2018-05-03T07:18:37Z
dc.date.issued	2011
dc.identifier.citation	Ordin, B., Nuriyeva, F. (2011). Analysis of dominating subset with minimal weight problem. Selcuk Journal of Applied Mathematics, 12 (1), 43-52.	tr_TR
dc.identifier.issn	1302-7980
dc.identifier.uri	http://hdl.handle.net/123456789/10525
dc.description	URL: http://sjam.selcuk.edu.tr/sjam/article/view/278	tr_TR
dc.description.abstract	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.	tr_TR
dc.language.iso	en	tr_TR
dc.publisher	Selcuk University Research Center of Applied Mathematics	tr_TR
dc.subject	Combinatorial optimization	tr_TR
dc.subject	Set covering problem	tr_TR
dc.subject	Weighted set covering problem	tr_TR
dc.subject	Kombinatoryal optimizasyon	tr_TR
dc.subject	Kaplama problemini ayarlama	tr_TR
dc.subject	Ağırlıklı set kaplama problemi	tr_TR
dc.title	Analysis of dominating subset with minimal weight problem	tr_TR
dc.type	Article	tr_TR
dc.relation.journal	Selcuk Journal of Applied Mathematics
dc.identifier.volume	12
dc.identifier.startpage	43
dc.identifier.endpage	52