MILP formulations for the modularity density maximization problem
From MaRDI portal
Recommendations
- Complete mixed integer linear programming formulations for modularity density based clustering
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Divisive heuristic for modularity density maximization
- Modified modularity density maximization and density ratio heuristic
- On Finding Graph Clusterings with Maximum Modularity
Cited in
(13)- A doubly nonnegative relaxation for modularity density maximization
- Divisive heuristic for modularity density maximization
- Efficient modularity density heuristics for large graphs
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Graph clustering via intra-cluster density maximization
- Exact computational solution of modularity density maximization by effective column generation
- Concise integer linear programming formulation for clique partitioning problems
- Modularity maximization to design contiguous policy zones for pandemic response
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Two-mode modularity clustering of parts and activities for cell formation problems
- Modified modularity density maximization and density ratio heuristic
- Complete mixed integer linear programming formulations for modularity density based clustering
This page was built for publication: MILP formulations for the modularity density maximization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319514)
