A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem

The quadratic minimum spanning tree problem (QMSTP) is a spanning tree optimization problem that considers the interaction cost between pairs of edges arising from a number of practical scenarios. This problem is NP-hard, and therefore there is not a known polynomial time approach to solve it. To fi...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Shufan Zhang, Jianlin Mao, Niya Wang, Dayan Li, Chengan Ju
Formato:	Artigo
Idioma:	Inglês
Publicado em:	MDPI AG 2022-12-01
Colecção:	Entropy
Assuntos:	quadratic minimum spanning tree problem memetic algorithm combinatorial optimization agglomerative clustering
Acesso em linha:	https://www.mdpi.com/1099-4300/25/1/87
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!