A branch and bound algorithm for a class of non-convex programming problems (Q4901802)
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 branch and bound algorithm for a class of non-convex programming problems |
scientific article; zbMATH DE number 6130219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for a class of non-convex programming problems |
scientific article; zbMATH DE number 6130219 |
Statements
24 January 2013
0 references
non-convex programming
0 references
branch and bound
0 references
global optimization
0 references
0.9323580265045166
0 references
0.814531147480011
0 references
0.8120721578598022
0 references
