Performances of parallel branch and bound algorithms with best-first search (Q1917301): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:36, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performances of parallel branch and bound algorithms with best-first search |
scientific article |
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
