A multiple search operator heuristic for the max-k-cut problem (Q513573): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-016-2234-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-016-2234-0 / rank | |||
Normal rank | |||
Latest revision as of 20:01, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multiple search operator heuristic for the max-k-cut problem |
scientific article |
Statements
A multiple search operator heuristic for the max-k-cut problem (English)
0 references
7 March 2017
0 references
max-k-cut and max-cut
0 references
graph partition
0 references
multiple search strategies
0 references
tabu list
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
