A dynamic programming algorithm for the knapsack problem with setup (Q342065)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dynamic programming algorithm for the knapsack problem with setup |
scientific article; zbMATH DE number 6654037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming algorithm for the knapsack problem with setup |
scientific article; zbMATH DE number 6654037 |
Statements
A dynamic programming algorithm for the knapsack problem with setup (English)
0 references
17 November 2016
0 references
knapsack problems
0 references
setup
0 references
dynamic programming
0 references
combination
0 references
production planning
0 references
0.8783419132232666
0 references
0.8675642013549805
0 references
0.8674074411392212
0 references
0.8578184247016907
0 references
0.8391261100769043
0 references
