On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048)
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: On the classification of NP-complete problems in terms of their correlation coefficient |
scientific article; zbMATH DE number 1395016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the classification of NP-complete problems in terms of their correlation coefficient |
scientific article; zbMATH DE number 1395016 |
Statements
On the classification of NP-complete problems in terms of their correlation coefficient (English)
0 references
3 July 2002
0 references
local search
0 references
meta-heuristics
0 references
autocorrelation coefficient
0 references
classification of combinatorial optimization
0 references
problems
0 references
0 references
0 references
0 references
0 references
0.8895291
0 references
0.8874241
0 references
0.87278473
0 references
0.84793824
0 references
0.8468659
0 references
