A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:43, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new bound-and-reduce approach of nonconvex quadratic programming problems |
scientific article |
Statements
A new bound-and-reduce approach of nonconvex quadratic programming problems (English)
0 references
4 January 2016
0 references
nonconvex quadratic programming
0 references
global optimization
0 references
branch-and-bound
0 references
relaxation technique
0 references
hyper-rectangle reducing
0 references
