Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: final exam scheduling / rank | |||
Normal rank | |||
Revision as of 20:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the clique partitioning problem as a maximally diverse grouping problem |
scientific article |
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
