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,...

Celý popis

Podrobná bibliografia

Vydané v:	Expert systems Ročník 36; číslo 2
Hlavní autori:	Majumder, Saibal, Kar, Samarjit, Pal, Tandra
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.04.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!