A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829)
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 5320578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational comparison of some branch and bound methods for indefinite quadratic programs |
scientific article; zbMATH DE number 5320578 |
Statements
A computational comparison of some branch and bound methods for indefinite quadratic programs (English)
0 references
3 September 2008
0 references
quadratic programming
0 references
branch and bound
0 references
d.c. decomposition
0 references
0 references
0 references
0.8521891832351685
0 references
0.8479409217834473
0 references
0.846753716468811
0 references
0.839320719242096
0 references
0.8384692072868347
0 references
