Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007): Difference between revisions
From MaRDI portal
Latest revision as of 18:39, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds |
scientific article |
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
