Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299)
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: Solving the clique partitioning problem as a maximally diverse grouping problem |
scientific article; zbMATH DE number 6805892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the clique partitioning problem as a maximally diverse grouping problem |
scientific article; zbMATH DE number 6805892 |
Statements
Solving the clique partitioning problem as a maximally diverse grouping problem (English)
0 references
10 November 2017
0 references
clique partitioning
0 references
maximum diverse grouping problem
0 references
variable neighborhood search
0 references
0 references
0.8011277914047241
0 references
0.7648886442184448
0 references
0.7641509175300598
0 references
0.7595776319503784
0 references
0.7447791695594788
0 references
