From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPLR / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SeDuMi / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDP_S / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-004-4838-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058989416 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:03, 19 March 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
