Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697)
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 1523205
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the multiple knapsack problem with assignment restrictions |
scientific article; zbMATH DE number 1523205 |
Statements
Approximation algorithms for the multiple knapsack problem with assignment restrictions (English)
0 references
6 February 2001
0 references
multiple knapsack problem with assignment restrictions
0 references
maximizing assigned weight
0 references
minimizing utilized capacity
0 references
approximate solutions
0 references
polynomial computational time
0 references
0.8846824169158936
0 references
0.8494222164154053
0 references
0.8436539769172668
0 references
0.829190194606781
0 references
