A semidefinite programming method for integer convex quadratic minimization (Q1749779)
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: A semidefinite programming method for integer convex quadratic minimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8124113082885742
0 references
0.810161828994751
0 references
0.8005688786506653
0 references
0.7988871932029724
0 references
