From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDP_S / rank | |||
Normal rank | |||
Revision as of 05:20, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems |
scientific article |
Statements
From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (English)
0 references
13 May 2005
0 references
semidefinite programming
0 references
quadratic assignment problem
0 references
\(K\)-CLUSTER problem
0 references
constrained-memory allocation problem
0 references
