A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710)

From MaRDI portal
Revision as of 02:07, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/ChekuriK05, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references