A semidefinite programming method for integer convex quadratic minimization (Q1749779): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-017-1132-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-017-1132-Y / rank | |||
Normal rank | |||
Latest revision as of 08:04, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A semidefinite programming method for integer convex quadratic minimization |
scientific article |
Statements
A semidefinite programming method for integer convex quadratic minimization (English)
0 references
28 May 2018
0 references
convex optimization
0 references
integer quadratic programming
0 references
mixed integer programming
0 references
semidefinite relaxation
0 references
branch-and-bound
0 references
0 references
0 references
