Roman domination problem with uncertain positioning and deployment costs

In a connected simple graph, the weighted Roman domination problem is considered at which the cost of positioning at each vertex is imposed in addition to the costs of potential deployments from a vertex to some of its neighboring vertices. Proper decision in practice is prone to a high degree of in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Soft computing (Berlin, Germany) Jg. 24; H. 4; S. 2637 - 2645
1. Verfasser: Ghaffari-Hadigheh, Alireza
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2020
Springer Nature B.V
Schlagworte:
ISSN:1432-7643, 1433-7479
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In a connected simple graph, the weighted Roman domination problem is considered at which the cost of positioning at each vertex is imposed in addition to the costs of potential deployments from a vertex to some of its neighboring vertices. Proper decision in practice is prone to a high degree of indeterminacy, mostly raised by unpredictable events that do not obey the rules and prerequisites of the probability theory. In this study, we model this problem with such assumptions in the context of the uncertainty theory initiated by Liu (Uncertainty theory. Studies in fuzziness and soft computing, Springer, Berlin, 2007 ). Two different optimization models are presented, and a concrete example is provided for illustrative purposes. Weaknesses of the probability theory and fuzzy theory in dealing with this problem are also mentioned in detail.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-019-03811-z