From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422)
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: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems |
scientific article; zbMATH DE number 2168210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems |
scientific article; zbMATH DE number 2168210 |
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
0.9300571
0 references
0.9283896
0 references
0.9168656
0 references
0.9165505
0 references
0.91555595
0 references
0.9153507
0 references
0.9109262
0 references
0.91058946
0 references
