Heuristics Applied to Minimization of the Maximum-Diameter Clustering Problem
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2021.9448548
Abstract: This paper introduces two heuristic algorithms for the Maximum-Diameter Clustering Problem (MDCP), based on the Biased Random-Key Genetic Algorithm (BRKGA) and the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristics. This problem consists of finding k… read more here.
Keywords: diameter; maximum diameter; problem; clustering problem ... See more keywords