A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (Q2817838): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Bonmin / rank | |||
Normal rank | |||
Revision as of 00:58, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming |
scientific article |
Statements
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (English)
0 references
2 September 2016
0 references
integer programming
0 references
quadratic programming
0 references
global optimization
0 references
