A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem
Sign Up to like & getrecommendations! Published in 2022 at "Entropy"
DOI: 10.3390/e25010087
Abstract: 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… read more here.
Keywords: problem; tree problem; algorithm; quadratic minimum ... See more keywords