Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259)

From MaRDI portal
Revision as of 14:59, 29 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
scientific article

    Statements

    Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (English)
    0 references
    0 references
    0 references
    30 October 2000
    0 references
    0/1 knapsack problem
    0 references
    subset-sum problem
    0 references
    approximation
    0 references
    greedy algorithms
    0 references

    Identifiers