On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 07:49, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the classification of NP-complete problems in terms of their correlation coefficient |
scientific article |
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
