Using mathematical programming to refine heuristic solutions for network clustering - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2014

Using mathematical programming to refine heuristic solutions for network clustering

(1, 2) , (3)
1
2
3

Résumé

We propose mathematical programming based aproaches to refine graph clustering solutions computed by heuristics. Clustering partitions are refined by applying cluster splitting and a combination of merging and splitting actions. A refinement scheme based on iteratively fixing and releasing integer variables of a mixed-integer quadratic optimization formulation appears to be particularly efficient. Computational experiments show the effectiveness and efficiency of the proposed approaches.
Fichier principal
Vignette du fichier
Cafieri_NET2013.pdf (97.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01018034 , version 1 (03-07-2014)

Identifiants

  • HAL Id : hal-01018034 , version 1

Citer

Sonia Cafieri, Pierre Hansen. Using mathematical programming to refine heuristic solutions for network clustering. P. Pardalos, M. Batsyn, V. Kalyagin. Models, Algorithms and Technologies for Networks Analysis Proceedings of the 3rd International Conference on Network Analysis, Springer, pp xxxx, 2014, Springer Proceedings in Mathematics & Statistics, 9783319097572. ⟨hal-01018034⟩
297 Consultations
214 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More