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á bibliografie

Vydáno v:	Expert systems Ročník 36; číslo 2
Hlavní autoři:	Majumder, Saibal, Kar, Samarjit, Pal, Tandra
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Blackwell Publishing Ltd 01.04.2019
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!