Modified modularity density maximization and density ratio heuristic
type: Item
instance of: scholarly article
title: Modified modularity density maximization and density ratio heuristic
author: Zead Saleh
author: Harun Pirim
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634104
zbMATH Keywords: clustering
zbMATH Keywords: modularity maximization
zbMATH Keywords: modularity density maximization
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: MILP
describes a project that uses: Pajek datasets
describes a project that uses: SNAP
describes a project that uses: Silhouettes
describes a project that uses: Pajek
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106072
OpenAlex ID: W4308493099
cites work: Modularity-maximizing graph communities via mathematical programming
cites work: Fast unfolding of communities in large networks
cites work: Reformulation of a model for hierarchical divisive graph modularity maximization
cites work: Network community detection using modularity density measures
cites work: MILP formulations for the modularity density maximization problem
cites work: A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
cites work: On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
cites work: Divisive heuristic for modularity density maximization
cites work: Complete mixed integer linear programming formulations for modularity density based clustering
cites work: Exact computational solution of modularity density maximization by effective column generation
cites work: On Nonlinear Fractional Programming
cites work: Q4409849
cites work: Well-Separated Clusters and Optimal Fuzzy Partitions
cites work: L’algebre de Boole et ses applications en recherche operationnelle
cites work: Community structure in social and biological networks
cites work: A doubly nonnegative relaxation for modularity density maximization
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: A novel mixed integer linear programming model for clustering relational networks
cites work: A convex envelope formula for multilinear functions
cites work: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
cites work: Efficient modularity density heuristics for large graphs
cites work: An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
cites work: Existence and sum decomposition of vertex polyhedral convex envelopes
cites work: Finding community structures in complex networks using mixed integer optimisation
DOI: 10.1016/J.COR.2022.106072
description: scientific article; zbMATH DE number 7634104