Branch-and-bound and dynamic programming approaches for the knapsack problem (Q6633256)
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 7939149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound and dynamic programming approaches for the knapsack problem |
scientific article; zbMATH DE number 7939149 |
Statements
Branch-and-bound and dynamic programming approaches for the knapsack problem (English)
0 references
5 November 2024
0 references
knapsack 0-1 problem
0 references
branch-and-bound
0 references
dynamic programming
0 references
combinatorial optimization
0 references
0.8111855983734131
0 references
0.8100266456604004
0 references
0.799842119216919
0 references
