Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem |
scientific article |
Statements
Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (English)
0 references
19 June 2012
0 references
discounted knapsack problem
0 references
dynamic programming
0 references
problem partition
0 references
core concept
0 references
integer programming
0 references
numerical experiments
0 references
algorithm
0 references
