A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386)
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 fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations |
scientific article; zbMATH DE number 6945375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations |
scientific article; zbMATH DE number 6945375 |
Statements
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (English)
0 references
28 September 2018
0 references
integer programming
0 references
quadratic programming
0 references
global optimization
0 references
0 references
0 references
0 references
0.9048996567726136
0 references
0.8460819721221924
0 references
0.8460817933082581
0 references
0.8153510689735413
0 references
