A multiple search operator heuristic for the max-k-cut problem (Q513573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A multiple search operator heuristic for the max-k-cut problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7889121770858765
0 references
0.787277102470398
0 references
0.7773404717445374
0 references
0.7708896398544312
0 references
0.7703726887702942
0 references
