Algorithms for the bounded set-up knapsack problem (Q2467131): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 14:22, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the bounded set-up knapsack problem |
scientific article |
Statements
Algorithms for the bounded set-up knapsack problem (English)
0 references
18 January 2008
0 references
knapsack problems
0 references
dynamic programming
0 references
fully polynomial-time approximation schemes
0 references
