An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-011-9437-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996872016 / rank | |||
Normal rank | |||
Revision as of 20:47, 19 March 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
