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: | , , |
|---|---|
| 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 |