Cargando…
HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem
The capacitated clustering problem (CCP) divides the vertices of the undirected graph into several disjoint clusters so that the sum of the node weights in each cluster meets the capacity limit while maximizing the sum of the weight of the edges between nodes in the same cluster. CCP is a typical NP...
Autores principales: | Liu, Yaoyao, Guo, Ping, Zeng, Yi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8799340/ https://www.ncbi.nlm.nih.gov/pubmed/35096045 http://dx.doi.org/10.1155/2022/6400318 |
Ejemplares similares
-
Algorithmic problem solving
por: Backhouse, Roland C
Publicado: (2011) -
The hybrid block iterative algorithm for solving the system of equilibrium problems and variational inequality problems
por: Saewan, Siwaporn, et al.
Publicado: (2012) -
A Neighborhood Grid Clustering Algorithm for Solving Localization Problem in WSN Using Genetic Algorithm
por: Chen, Junfeng, et al.
Publicado: (2022) -
Solving text clustering problem using a memetic differential evolution algorithm
por: Mustafa, Hossam M. J., et al.
Publicado: (2020) -
New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem
por: Borowski, Michał, et al.
Publicado: (2020)