A feasible active set method with reoptimization for convex quadratic mixed-integer programming (Q2817838)
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 6622009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A feasible active set method with reoptimization for convex quadratic mixed-integer programming |
scientific article; zbMATH DE number 6622009 |
Statements
2 September 2016
0 references
integer programming
0 references
quadratic programming
0 references
global optimization
0 references
0 references
A feasible active set method with reoptimization for convex quadratic mixed-integer programming (English)
0 references
0.9194265007972716
0 references
0.7877482771873474
0 references
0.77639240026474
0 references
0.7763922810554504
0 references
