Column generation algorithms for exact modularity maximization in networks - ENAC - École nationale de l'aviation civile Accéder directement au contenu
Article Dans Une Revue Physical Review E : Statistical, Nonlinear, and Soft Matter Physics Année : 2010

Column generation algorithms for exact modularity maximization in networks

Résumé

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [Phys. Rev. E 69, 026113 (2004)], is modularity maximization. Many heuristics have been proposed for maximizing modularity and yield rapidly near optimal solution or sometimes optimal ones but without a guarantee of optimality. There are few exact algorithms, prominent among which is a paper by Xu et al. [Eur. Phys. J. B 60, 231 (2007)]. Modularity maximization can also be expressed as a clique partitioning problem and the row generation algorithm of Grötschel and Wakabayashi [Math. Program. 45, 59 (1989)] applied. We propose to extend both of these algorithms using the powerful column generation methods for linear and non linear integer programming. Performance of the four resulting algorithms is compared on problems from the literature. Instances with up to 512 entities are solved exactly. Moreover, the computing time of previously solved problems are reduced substantially.
Fichier principal
Vignette du fichier
580.pdf (241.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00934661 , version 1 (15-04-2014)

Identifiants

Citer

Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Leo Liberti, et al.. Column generation algorithms for exact modularity maximization in networks. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, 2010, 82 (4), pp 046112-1 - 046112-9. ⟨10.1103/PhysRevE.82.046112⟩. ⟨hal-00934661⟩
203 Consultations
815 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More