A semidefinite programming method for integer convex quadratic minimization (Q1749779): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MLAMBDA / rank | |||
Normal rank | |||
Revision as of 22:00, 28 February 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
