Rough‐fuzzy quadratic minimum spanning tree problem

A quadratic minimum spanning tree problem determines a minimum spanning tree of a network whose edges are associated with linear and quadratic weights. Linear weights represent the edge costs whereas the quadratic weights are the interaction costs between a pair of edges of the graph. In this study,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems Jg. 36; H. 2
Hauptverfasser:	Majumder, Saibal, Kar, Samarjit, Pal, Tandra
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Blackwell Publishing Ltd 01.04.2019
Schlagworte:	chance‐constrained programming Classification Confidence intervals epsilon‐constraint method Evolutionary algorithms Genetic algorithms Graph theory Graphical representations Mathematical models MOCHC NSGA‐II quadratic minimum spanning tree rough‐fuzzy variable Sensitivity analysis Sorting algorithms
ISSN:	0266-4720, 1468-0394
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!