Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-015-0869-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080943874 / rank | |||
Normal rank | |||
Revision as of 02:10, 20 March 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
