The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems (Q2803598)
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: The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems |
scientific article; zbMATH DE number 6575947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems |
scientific article; zbMATH DE number 6575947 |
Statements
The Bernstein Branch-and-Bound Unconstrained Global Optimization Algorithm for MINLP Problems (English)
0 references
2 May 2016
0 references
0.9174892902374268
0 references
0.8946304321289062
0 references
0.8733741641044617
0 references
0.8655611276626587
0 references
