An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6197001 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
tabu search | |||
| Property / zbMATH Keywords: tabu search / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum clique | |||
| Property / zbMATH Keywords: maximum clique / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
constrained neighborhood | |||
| Property / zbMATH Keywords: constrained neighborhood / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
informed restart | |||
| Property / zbMATH Keywords: informed restart / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial optimization | |||
| Property / zbMATH Keywords: combinatorial optimization / rank | |||
Normal rank | |||
Revision as of 11:03, 28 June 2023
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
