An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs (Q1734849)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs |
scientific article; zbMATH DE number 7043536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs |
scientific article; zbMATH DE number 7043536 |
Statements
An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs (English)
0 references
27 March 2019
0 references
graph clustering
0 references
modularity density
0 references
set partitioning
0 references
branch-and-price
0 references
set-packing relaxation
0 references
multiple cutting planes
0 references
0 references
0 references
0 references
0 references
0.8513212203979492
0 references
0.8509109616279602
0 references
0.8472464680671692
0 references
0.8339951634407043
0 references
0.7946367859840393
0 references
