SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791)
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: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances |
scientific article; zbMATH DE number 6116940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances |
scientific article; zbMATH DE number 6116940 |
Statements
SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (English)
0 references
19 December 2012
0 references
low rank factorization
0 references
unconstrained binary quadratic programming
0 references
max-cut
0 references
nonlinear programming
0 references
0 references
0 references
0 references
0 references
0 references
