A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
Revision as of 00:06, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem |
scientific article |
Statements
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (English)
0 references
23 November 2007
0 references
variable reduction
0 references
