Unbounded knapsack problem: Dynamic programming revisited (Q1569945): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00265-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087203776 / rank | |||
Normal rank | |||
Revision as of 11:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unbounded knapsack problem: Dynamic programming revisited |
scientific article |
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
