Exact computational solution of modularity density maximization by effective column generation
From MaRDI portal
Publication:1652372
DOI10.1016/j.cor.2017.04.013zbMath1391.90617OpenAlexW2607925293MaRDI QIDQ1652372
Rafael de Santiago, Luís C. Lamb
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.04.013
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)
Related Items (3)
A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs ⋮ Modified modularity density maximization and density ratio heuristic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- MILP formulations for the modularity density maximization problem
- Community detection by modularity maximization using GRASP with path relinking
- Divisive heuristic for modularity density maximization
- The structure and function of networks
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
- A hybrid artificial immune network for detecting communities in complex networks
- Spectral redemption in clustering sparse networks
- Decomposition Principle for Linear Programs
- Encyclopedia of Operations Research and Management Science
- QUANTITATIVE MEASURE FOR COMMUNITY DETECTION IN WEIGHTED NETWORKS
- An Efficient Heuristic Procedure for Partitioning Graphs
- Fast unfolding of communities in large networks
- Multilevel local search algorithms for modularity clustering
- Overlapping community detection in networks
This page was built for publication: Exact computational solution of modularity density maximization by effective column generation
