A polynomial-time algorithm for knapsack with divisible item sizes (Q287072)
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: A polynomial-time algorithm for knapsack with divisible item sizes |
scientific article; zbMATH DE number 6585415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for knapsack with divisible item sizes |
scientific article; zbMATH DE number 6585415 |
Statements
A polynomial-time algorithm for knapsack with divisible item sizes (English)
0 references
26 May 2016
0 references
computational complexity
0 references
combinatorial problems
0 references
knapsack
0 references
0.9106987714767456
0 references
0.8444464802742004
0 references
0.7990164160728455
0 references
0.7886326909065247
0 references
