Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems (Q5943818)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1648630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems |
scientific article; zbMATH DE number 1648630 |
Statements
Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems (English)
0 references
19 September 2001
0 references
semidefinite programming
0 references
MAX-CUT problems
0 references
branch-and-cut
0 references
0.7844085693359375
0 references
0.7759119272232056
0 references
0.7730585932731628
0 references
0.7679844498634338
0 references
0.7618754506111145
0 references
