Active set methods with reoptimization for convex quadratic integer programming (Q3195322)
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 6495548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Active set methods with reoptimization for convex quadratic integer programming |
scientific article; zbMATH DE number 6495548 |
Statements
Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (English)
0 references
16 October 2015
0 references
few linear constraints, enumeration of the branch-and-bound nodes
0 references
0.9194265007972716
0 references
0.8455062508583069
0 references
0.845505952835083
0 references
0.7840458750724792
0 references
0.7838057279586792
0 references
