A discrete dynamic convexized method for the max-cut problem (Q1761827)
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 discrete dynamic convexized method for the max-cut problem |
scientific article; zbMATH DE number 6107362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discrete dynamic convexized method for the max-cut problem |
scientific article; zbMATH DE number 6107362 |
Statements
A discrete dynamic convexized method for the max-cut problem (English)
0 references
15 November 2012
0 references
max-cut problem
0 references
local search
0 references
dynamic convexized method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9085911
0 references
0.9076241
0 references
0.90656453
0 references
0.9023696
0 references
0.8948377
0 references
0.89477503
0 references
0.88858247
0 references
