Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116)
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: Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem |
scientific article; zbMATH DE number 6391354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem |
scientific article; zbMATH DE number 6391354 |
Statements
Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (English)
0 references
27 January 2015
0 references
max-cut
0 references
local search
0 references
dynamic convexized method
0 references
clustered adaptive multistart
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9076241
0 references
0.86863476
0 references
0.8541461
0 references
0.8467033
0 references
0.84649044
0 references
0.83983254
0 references
0.8392484
0 references
0.8388545
0 references
