Algorithms for the bounded set-up knapsack problem (Q2467131)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for the bounded set-up knapsack problem |
scientific article; zbMATH DE number 5228533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the bounded set-up knapsack problem |
scientific article; zbMATH DE number 5228533 |
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
0.8543047308921814
0 references
0.8391261100769043
0 references
0.8374099731445312
0 references
0.8303345441818237
0 references
0.8227547407150269
0 references
