An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651)
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: An adaptive multistart tabu search approach to solve the maximum clique problem |
scientific article; zbMATH DE number 6197001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive multistart tabu search approach to solve the maximum clique problem |
scientific article; zbMATH DE number 6197001 |
Statements
An adaptive multistart tabu search approach to solve the maximum clique problem (English)
0 references
9 August 2013
0 references
tabu search
0 references
maximum clique
0 references
constrained neighborhood
0 references
informed restart
0 references
combinatorial optimization
0 references
0 references
0 references
0.8700336813926697
0 references
0.8152977228164673
0 references
0.8152693510055542
0 references
0.8086031079292297
0 references
