Unbounded knapsack problem: Dynamic programming revisited (Q1569945)
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 1471189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unbounded knapsack problem: Dynamic programming revisited |
scientific article; zbMATH DE number 1471189 |
Statements
Unbounded knapsack problem: Dynamic programming revisited (English)
0 references
20 September 2000
0 references
integer programming
0 references
dominances
0 references
dynamic programming
0 references
periodicity
0 references
combinatorial optimization
0 references
0 references
0.80766361951828
0 references
0.8065527081489563
0 references
0.8046919107437134
0 references
0.8039771914482117
0 references
