Performances of parallel branch and bound algorithms with best-first search (Q1917301)
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: Performances of parallel branch and bound algorithms with best-first search |
scientific article; zbMATH DE number 897403
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performances of parallel branch and bound algorithms with best-first search |
scientific article; zbMATH DE number 897403 |
Statements
Performances of parallel branch and bound algorithms with best-first search (English)
0 references
7 July 1996
0 references
parallel branch
0 references
bound algorithm
0 references
