A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem

Given a connected, weighted, undirected graph G = (V, E), the bi-objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) Problem aims to find spanning trees on G with minimal total edge weight as well as minimal diameter. The problem is known to be NP-hard and finds application in domains ranging f...

Celý popis

Podrobná bibliografie

Vydáno v:	Engineering applications of artificial intelligence Ročník 87; s. 103237
Hlavní autoři:	Prakash, V. Prem, Patvardhan, C., Srivastav, Anand
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.01.2020
Témata:	Bounded diameter Hybrid evolutionary Meta-heuristic Multi-objective NP-hard Spanning tree NP-hard Multi-objective Meta-heuristic Hybrid evolutionary Spanning tree Bounded diameter
ISSN:	0952-1976, 1873-6769
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!