Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-008-9372-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-008-9372-0 / rank | |||
Normal rank | |||
Latest revision as of 13:52, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming |
scientific article |
Statements
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (English)
0 references
13 July 2009
0 references
0 references
0 references
0 references
0 references
