A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A provable better Branch and Bound method for a nonconvex integer quadratic programming problem |
scientific article; zbMATH DE number 2137263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A provable better Branch and Bound method for a nonconvex integer quadratic programming problem |
scientific article; zbMATH DE number 2137263 |
Statements
A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (English)
0 references
23 February 2005
0 references
Nonconvex integer quadratic programming
0 references
branch and bound
0 references
Complete enumeration
0 references
0.8432292938232422
0 references
0.8242485523223877
0 references
0.8196696043014526
0 references
0.8076711297035217
0 references
