A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145)
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 5490266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for globally solving a class of nonconvex programming problems |
scientific article; zbMATH DE number 5490266 |
Statements
A branch and bound algorithm for globally solving a class of nonconvex programming problems (English)
0 references
13 January 2009
0 references
nonconvex programming
0 references
global optimization
0 references
linear relaxation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0.9323580265045166
0 references
0.8373860716819763
0 references
0.8240540623664856
0 references
