Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697)

From MaRDI portal
Revision as of 05:00, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for the multiple knapsack problem with assignment restrictions
scientific article

    Statements

    Approximation algorithms for the multiple knapsack problem with assignment restrictions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2001
    0 references
    0 references
    0 references
    0 references
    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