Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (Q2666932)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7432168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal strategy for solving a special case of the knapsack problem by the branch and bound method |
scientific article; zbMATH DE number 7432168 |
Statements
Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (English)
0 references
23 November 2021
0 references
knapsack problem
0 references
branch and bound method
0 references
problem solution complexity
0 references
solution strategy
0 references
0 references
0.7977702617645264
0 references
0.7906585335731506
0 references
0.7890551686286926
0 references
0.7818264365196228
0 references
