Modified modularity density maximization and density ratio heuristic
From MaRDI portal
Publication:2108173
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
- A convex envelope formula for multilinear functions
- A doubly nonnegative relaxation for modularity density maximization
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- A novel mixed integer linear programming model for clustering relational networks
- An Efficient Heuristic Procedure for Partitioning Graphs
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Community structure in social and biological networks
- Complete mixed integer linear programming formulations for modularity density based clustering
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Divisive heuristic for modularity density maximization
- Efficient modularity density heuristics for large graphs
- Exact computational solution of modularity density maximization by effective column generation
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Fast unfolding of communities in large networks
- Finding community structures in complex networks using mixed integer optimisation
- scientific article; zbMATH DE number 1943822 (Why is no real title available?)
- L’algebre de Boole et ses applications en recherche operationnelle
- MILP formulations for the modularity density maximization problem
- Modularity-maximizing graph communities via mathematical programming
- Network community detection using modularity density measures
- On Nonlinear Fractional Programming
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Well-Separated Clusters and Optimal Fuzzy Partitions
Cited in
(7)- Exact computational solution of modularity density maximization by effective column generation
- Complete mixed integer linear programming formulations for modularity density based clustering
- Efficient modularity density heuristics for large graphs
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- MILP formulations for the modularity density maximization problem
- Improving heuristics for network modularity maximization using an exact algorithm
- Integer programming in psychology: a review and directions for future research
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)
