A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829)
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 algorithm for the multiple knapsack problem with divisible item sizes |
scientific article; zbMATH DE number 5771265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the multiple knapsack problem with divisible item sizes |
scientific article; zbMATH DE number 5771265 |
Statements
A polynomial algorithm for the multiple knapsack problem with divisible item sizes (English)
0 references
16 August 2010
0 references
analysis of algorithms
0 references
multiple knapsack problem
0 references
divisible sizes
0 references
polynomial algorithms
0 references
0 references
0.9106987714767456
0 references
0.7946377992630005
0 references
0.7939813733100891
0 references
