Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1134/s0965542507090084 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1134/S0965542507090084 / rank | |||
Normal rank | |||
Latest revision as of 18:39, 30 December 2024
scientific article; zbMATH DE number 7812380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method |
scientific article; zbMATH DE number 7812380 |
Statements
Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (English)
0 references
4 March 2024
0 references
knapsack problem
0 references
branch-and-bound method
0 references
algorithms for parallel computations
0 references
discrete optimization
0 references
local optimization
0 references
