Cargando…
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...
Autores principales: | Zhang, Shufan, Mao, Jianlin, Wang, Niya, Li, Dayan, Ju, Chengan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
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 |
Ejemplares similares
-
A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core
por: Gao, Qiang, et al.
Publicado: (2022) -
An improved adaptive memetic differential evolution optimization algorithms for data clustering problems
por: Mustafa, Hossam M. J., et al.
Publicado: (2019) -
Solving text clustering problem using a memetic differential evolution algorithm
por: Mustafa, Hossam M. J., et al.
Publicado: (2020) -
The problem of the minimum of a quadratic functional
por: Mikhlin, Solomon Grigorievich
Publicado: (1965) -
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants
por: Carvalho, Iago A., et al.
Publicado: (2023)