A Study of the Multi-Objective Neighboring Only Quadratic Minimum Spanning Tree Problem in the Context of Uncertainty

The pursuit of studying the quadratic minimum spanning tree (QMST) problem has captivated numerous academics because of its distinctive characteristic of taking into account the cost of interaction between pairs of edges. A QMST refers to the minimum spanning tree, which is a graph that is both acyc...

Ausführliche Beschreibung

Bibliografische Detailangaben

Hauptverfasser:	Debosree Pal, Haresh Kumar Sharma, Olegas Prentkovskis, Falguni Chakraborty, Lijana Maskeliūnaitė
Format:	Artigo
Sprache:	Inglês
Veröffentlicht:	MDPI AG 2024-10-01
Schriftenreihe:	Applied Sciences
Schlagworte:	adjacent only quadratic minimum spanning tree fuzzy chance-constrained programming global criterion method non-dominated sorting genetic algorithm II duplicate elimination non-dominated sorting evolutionary algorithm
Online-Zugang:	https://www.mdpi.com/2076-3417/14/19/8941
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!