An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081)
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: An effective branch-and-bound algorithm for convex quadratic integer programming |
scientific article; zbMATH DE number 6093775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective branch-and-bound algorithm for convex quadratic integer programming |
scientific article; zbMATH DE number 6093775 |
Statements
An effective branch-and-bound algorithm for convex quadratic integer programming (English)
0 references
15 October 2012
0 references
convex quadratic minimization
0 references
closest vector problem
0 references
branch-and-bound algorithm
0 references
computational results
0 references
0 references
1.000001311302185
0 references
0.8582176566123962
0 references
0.8460817933082581
0 references
0.8455062508583069
0 references
