A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (Q4558310)
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 6982542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem |
scientific article; zbMATH DE number 6982542 |
Statements
A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (English)
0 references
21 November 2018
0 references
multiple knapsack problem
0 references
lexicographic ordering
0 references
approximation algorithm
0 references
approximation ratio
0 references
0.9209549
0 references
0.9200784
0 references
0.9192001
0 references
0.9130997
0 references
0.91088367
0 references
0.91088367
0 references
0.9107286
0 references
0.9093666
0 references
0.90639997
0 references
