A simple simulated annealing algorithm for the maximum clique problem (Q2456476)
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: A simple simulated annealing algorithm for the maximum clique problem |
scientific article; zbMATH DE number 5201944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple simulated annealing algorithm for the maximum clique problem |
scientific article; zbMATH DE number 5201944 |
Statements
A simple simulated annealing algorithm for the maximum clique problem (English)
0 references
18 October 2007
0 references
Simulated annealing algorithm
0 references
maximum clique problem
0 references
minimum vertex cover problem
0 references
NP-hard optimization problem
0 references
heuristic algorithm
0 references
0 references
0.8039095401763916
0 references
0.7854129076004028
0 references
0.7824057936668396
0 references
