A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6484172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial case of convex integer quadratic programming problems with box integer constraints |
scientific article; zbMATH DE number 6484172 |
Statements
A polynomial case of convex integer quadratic programming problems with box integer constraints (English)
0 references
22 September 2015
0 references
quadratic integer optimization
0 references
polynomial solvable case
0 references
box constrained
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8076460957527161
0 references
0.7996941804885864
0 references
0.7809506058692932
0 references
0.7809504866600037
0 references
0.7803594470024109
0 references
