Divisive heuristic for modularity density maximization
DOI10.1016/J.COR.2016.01.009zbMATH Open1349.90850OpenAlexW2301317426MaRDI QIDQ342346FDOQ342346
Authors: Sergey Kushnarev, Leo Liberti, Zeyu Sun, Alberto Costa 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.009
Recommendations
- Reformulation of a model for hierarchical divisive graph modularity maximization
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- A partitioning-based divisive clustering technique for maximizing the modularity
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- MILP formulations for the modularity density maximization problem
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- A $k$-Sample Model in Order Statistics
- Fast unfolding of communities in large networks
- A mixed integer linear model for clustering with variable selection
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- A cutting plane algorithm for a clustering problem
- Branching and bounds tighteningtechniques for non-convex MINLP
- MILP formulations for the modularity density maximization problem
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Community detection by modularity maximization using GRASP with path relinking
- 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
- Redundant constraints in the standard formulation for the clique partitioning problem
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Reformulations in Mathematical Programming: Definitions and Systematics
- Adding cohesion constraints to models for modularity maximization in networks
- Reformulation of a model for hierarchical divisive graph modularity maximization
Cited In (12)
- Improving heuristics for network modularity maximization using an exact algorithm
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- 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 doubly nonnegative relaxation for modularity density maximization
- 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
- Modified modularity density maximization and density ratio heuristic
- Reformulation of a model for hierarchical divisive graph modularity maximization
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- A partitioning-based divisive clustering technique for maximizing the modularity
Uses Software
This page was built for publication: Divisive heuristic for modularity density maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342346)
