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...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
MDPI AG
2022-12-01
|
| Colección: | Entropy |
| Materias: | |
| Acceso en línea: | https://www.mdpi.com/1099-4300/25/1/87 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|