Improved K-Means Algorithm for Capacitated Clustering Problem
The Capacitated Clustering Problem (CCP) partitions a set of n items (eg. customer orders) into k disjoint clusters with known capacity. During clustering the items with shortest assigning paths from centroids are grouped together. The summation of grouped items should not exceed the capacity of clu...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/282 |
| País: | Brasil |
| Oai: | oai:infocomp.dcc.ufla.br:article/282 |