SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q58002884, #quickstatements; #temporary_batch_1711055989931 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58002884 / rank | |||
Normal rank | |||
Revision as of 00:54, 22 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances |
scientific article |
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
