An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: EXTRACOL / rank | |||
Normal rank |
Revision as of 21:59, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An adaptive multistart tabu search approach to solve the maximum clique problem |
scientific article |
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