SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10107-012-0593-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2029471744 / rank | |||
Normal rank |
Revision as of 23:21, 19 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