The knapsack problem with a minimum filling constraint (Q3120586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7032001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The knapsack problem with a minimum filling constraint |
scientific article; zbMATH DE number 7032001 |
Statements
The knapsack problem with a minimum filling constraint (English)
0 references
5 March 2019
0 references
approximation scheme
0 references
polynomial time
0 references
knapsack problem
0 references
minimum filling constraint
0 references
0.9225466
0 references
0.9119589
0 references
0.90980756
0 references
0.90980756
0 references
0.9041843
0 references
0.9040248
0 references
