A minimal algorithm for the multiple-choice knapsack problem (Q1388832): 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/0377-2217(95)00015-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086168649 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimal algorithm for the multiple-choice knapsack problem |
scientific article |
Statements
A minimal algorithm for the multiple-choice knapsack problem (English)
0 references
11 June 1998
0 references
knapsack problem
0 references
dynamic programming
0 references
reduction
0 references
multiple-choice knapsack problem
0 references
partitioning
0 references
