Node selection strategies in interval branch and bound algorithms (Q5964243)
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: Node selection strategies in interval branch and bound algorithms |
scientific article; zbMATH DE number 6546937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Node selection strategies in interval branch and bound algorithms |
scientific article; zbMATH DE number 6546937 |
Statements
Node selection strategies in interval branch and bound algorithms (English)
0 references
29 February 2016
0 references
intervals
0 references
global optimization
0 references
node selection
0 references
branch and bound
0 references
0 references
0 references
0 references
0.8094843029975891
0 references
0.807971179485321
0 references
0.7996974587440491
0 references
0.7957512140274048
0 references
