A computational study on QP problems with general linear constraints (Q2673522)
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 7539451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study on QP problems with general linear constraints |
scientific article; zbMATH DE number 7539451 |
Statements
A computational study on QP problems with general linear constraints (English)
0 references
10 June 2022
0 references
quadratic programming
0 references
branch-and-bound
0 references
linear and convex relaxations
0 references
bound tightening
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7753750085830688
0 references
0.7753749489784241
0 references
0.7684606909751892
0 references
0.7659574151039124
0 references
