A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62002052, #quickstatements; #temporary_batch_1706331283219 |
Added link to MaRDI item. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:55, 7 March 2024
scientific article; zbMATH DE number 5029546
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem |
scientific article; zbMATH DE number 5029546 |
Statements
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (English)
0 references
1 June 2006
0 references
multiple knapsack problem
0 references
generalized assignment problem
0 references
polynomial time approximation scheme
0 references
approximation algorithm
0 references
