Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007)
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: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds |
scientific article; zbMATH DE number 5703321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds |
scientific article; zbMATH DE number 5703321 |
Statements
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (English)
0 references
3 May 2010
0 references
global optimization
0 references
branch and bound
0 references
selection strategies
0 references
Lipschitz optimization
0 references
parallel branch and bound
0 references
0 references
0 references
0 references
0.7898470163345337
0 references
0.7770687937736511
0 references
0.765789806842804
0 references
0.7641157507896423
0 references
0.7610806822776794
0 references
