Noising methods for a clique partitioning problem (Q2489901)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5021010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Noising methods for a clique partitioning problem |
scientific article; zbMATH DE number 5021010 |
Statements
Noising methods for a clique partitioning problem (English)
0 references
28 April 2006
0 references
Noising methods
0 references
Metaheuristics
0 references
Simulated annealing
0 references
Threshold accepting algorithms
0 references
Clique partitioning of a weighted graph
0 references
Aggregation of relations
0 references
Classification
0 references
Clustering
0 references
Régnier's problem
0 references
Zahn's problem
0 references
0 references
0 references
0.8204531669616699
0 references
0.7910937666893005
0 references
0.7427265644073486
0 references
0.7174761295318604
0 references
0.7129427194595337
0 references
