Divisive heuristic for modularity density maximization
From MaRDI portal
Publication:342346
DOI10.1016/j.cor.2016.01.009zbMath1349.90850OpenAlexW2301317426MaRDI QIDQ342346
Sergey Kushnarev, Zeyu Sun, Leo Liberti, Alberto L. C. 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
Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Exact computational solution of modularity density maximization by effective column generation, 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, Complete mixed integer linear programming formulations for modularity density based clustering, Efficient modularity density heuristics for large graphs, A doubly nonnegative relaxation for modularity density maximization, Modified modularity density maximization and density ratio heuristic
Uses Software
Cites Work
- MILP formulations for the modularity density maximization problem
- Community detection by modularity maximization using GRASP with path relinking
- A mixed integer linear model for clustering with variable selection
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
- A cutting plane algorithm for a clustering problem
- A convex envelope formula for multilinear functions
- 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
- Branching and bounds tighteningtechniques for non-convex MINLP
- Reformulations in Mathematical Programming: Definitions and Systematics
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Adding cohesion constraints to models for modularity maximization in networks
- Fast unfolding of communities in large networks
- A $k$-Sample Model in Order Statistics
