A study of parallel branch-and-bound algorithms with best-bound-first search (Q1825604)
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: Publication:1825604 |
scientific article; zbMATH DE number 4121329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A study of parallel branch-and-bound algorithms with best-bound-first search |
scientific article; zbMATH DE number 4121329 |
Statements
A study of parallel branch-and-bound algorithms with best-bound-first search (English)
0 references
1989
0 references
optimization
0 references
parallelization
0 references
performance analysis
0 references
Best-bound-first parallel branch-and-bound algorithms
0 references
numerical comparison
0 references
0.8661649823188782
0 references
0.8603220582008362
0 references
0.8524782061576843
0 references
0.8260579109191895
0 references
