Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4434988 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4821303 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4350063 / rank | |||
Normal rank | |||
Revision as of 15:30, 27 August 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
