Skip to Main content Skip to Navigation
Book sections

Using mathematical programming to refine heuristic solutions for network clustering

Abstract : 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.
Document type :
Book sections
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Céline Smith Connect in order to contact the contributor
Submitted on : Thursday, July 3, 2014 - 3:18:52 PM
Last modification on : Tuesday, October 19, 2021 - 11:16:56 PM
Long-term archiving on: : Friday, October 3, 2014 - 11:30:01 AM


Files produced by the author(s)


  • HAL Id : hal-01018034, version 1


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⟩



Record views


Files downloads