A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: DBLP publication ID (P1635): journals/siamcomp/ChekuriK05, #quickstatements; #temporary_batch_1731543907597 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62002052 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/ChekuriK05 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:07, 14 November 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
