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.
Cited literature [34 references]
https://hal-enac.archives-ouvertes.fr/hal-01018034
Contributor : Céline Smith <>
Submitted on : Thursday, July 3, 2014 - 3:18:52 PM
Last modification on : Thursday, March 5, 2020 - 5:55:11 PM
Document(s) archivé(s) le : Friday, October 3, 2014 - 11:30:01 AM
Contributor : Céline Smith <>
Submitted on : Thursday, July 3, 2014 - 3:18:52 PM
Last modification on : Thursday, March 5, 2020 - 5:55:11 PM
Document(s) archivé(s) le : Friday, October 3, 2014 - 11:30:01 AM
File
Cafieri_NET2013.pdf
Files produced by the author(s)
