Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
From MaRDI portal
Publication:5265217
DOI10.1007/978-3-319-09758-9_2zbMath1328.90123OpenAlexW1031007865MaRDI QIDQ5265217
Publication date: 23 July 2015
Published in: Models, Algorithms and Technologies for Network Analysis (Search for Journal in Brave)
Full work available at URL: https://hal-enac.archives-ouvertes.fr/hal-01018034/file/Cafieri_NET2013.pdf
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Improving heuristics for network modularity maximization using an exact algorithm
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Facets of the clique partitioning polytope
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
- A cutting plane algorithm for a clustering problem
- A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
- Community structure in social and biological networks
- Fast unfolding of communities in large networks
- Collective dynamics of ‘small-world’ networks
- Networks