Can Parallel Branch and Bound without Communication Be Effective? (Q4302313)
From MaRDI portal
scientific article; zbMATH DE number 618188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can Parallel Branch and Bound without Communication Be Effective? |
scientific article; zbMATH DE number 618188 |
Statements
Can Parallel Branch and Bound without Communication Be Effective? (English)
0 references
14 August 1994
0 references
parallel algorithm
0 references
branch and bound algorithm
0 references
quadratic assignment problem
0 references
graph partitioning problem
0 references
weighted vertex cover problem
0 references
