Modified modularity density maximization and density ratio heuristic
From MaRDI portal
Publication:2108173
DOI10.1016/J.COR.2022.106072OpenAlexW4308493099MaRDI QIDQ2108173FDOQ2108173
Authors: Zead Saleh, Harun Pirim 
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106072
Recommendations
- MILP formulations for the modularity density maximization problem
- Exact computational solution of modularity density maximization by effective column generation
- Divisive heuristic for modularity density maximization
- Finding network communities using modularity density
- scientific article; zbMATH DE number 6180551
Cites Work
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- An Efficient Heuristic Procedure for Partitioning Graphs
- Community structure in social and biological networks
- On Nonlinear Fractional Programming
- Fast unfolding of communities in large networks
- Well-Separated Clusters and Optimal Fuzzy Partitions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- MILP formulations for the modularity density maximization problem
- Existence and sum decomposition of vertex polyhedral convex envelopes
- L’algebre de Boole et ses applications en recherche operationnelle
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Divisive heuristic for modularity density maximization
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Efficient modularity density heuristics for large graphs
- Network community detection using modularity density measures
- Title not available (Why is that?)
- Exact computational solution of modularity density maximization by effective column generation
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Complete mixed integer linear programming formulations for modularity density based clustering
- A novel mixed integer linear programming model for clustering relational networks
- A doubly nonnegative relaxation for modularity density maximization
Cited In (6)
- Improving heuristics for network modularity maximization using an exact algorithm
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Complete mixed integer linear programming formulations for modularity density based clustering
- Efficient modularity density heuristics for large graphs
- MILP formulations for the modularity density maximization problem
- Exact computational solution of modularity density maximization by effective column generation
Uses Software
This page was built for publication: Modified modularity density maximization and density ratio heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108173)
