Pages that link to "Item:Q319514"
From MaRDI portal
The following pages link to MILP formulations for the modularity density maximization problem (Q319514):
Displaying 11 items.
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs (Q1734849) (← links)
- Complete mixed integer linear programming formulations for modularity density based clustering (Q1751238) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Two-mode modularity clustering of parts and activities for cell formation problems (Q1782160) (← links)
- Modified modularity density maximization and density ratio heuristic (Q2108173) (← links)
- Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
- Modularity maximization to design contiguous policy zones for pandemic response (Q2171547) (← links)
- A doubly nonnegative relaxation for modularity density maximization (Q2297659) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
