The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237)
From MaRDI portal
scientific article; zbMATH DE number 7830772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study |
scientific article; zbMATH DE number 7830772 |
Statements
The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (English)
0 references
11 April 2024
0 references
quasi-clique partitioning
0 references
maximum quasi-clique
0 references
computational complexity
0 references
integer programming
0 references
combinatorial optimization
0 references
network clustering
0 references
0 references
0 references
0 references
0 references
0 references
