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

Full description

Bibliographic Details

Published in:	Expert systems Vol. 36; no. 2
Main Authors:	Majumder, Saibal, Kar, Samarjit, Pal, Tandra
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.04.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!