Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 19:04, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements |
scientific article |
Statements
Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (English)
0 references
13 September 2016
0 references
maximum clique problem
0 references
MCS branch-and-bound algorithm
0 references
ILS heuristic
0 references
graph coloring
0 references
