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

Descripción completa

Detalles Bibliográficos
Autores principales: Zhang, Shufan, Mao, Jianlin, Wang, Niya, Li, Dayan, Ju, Chengan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9858573/
https://www.ncbi.nlm.nih.gov/pubmed/36673228
http://dx.doi.org/10.3390/e25010087

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9858573/
https://www.ncbi.nlm.nih.gov/pubmed/36673228
http://dx.doi.org/10.3390/e25010087

Ejemplares similares