Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization (Q6289817)
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: Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization |
preprint article from arXiv |
Statements
4 August 2017
0 references
math.OC
0 references
cs.CC
0 references
Roman Pogodin
0 references
Mikhail Krechetov
0 references
Yury Maximov
0 references
