Unbounded knapsack problems with arithmetic weight sequences (Q545110)

From MaRDI portal
Revision as of 05:24, 4 July 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
Unbounded knapsack problems with arithmetic weight sequences
scientific article

    Statements

    Unbounded knapsack problems with arithmetic weight sequences (English)
    0 references
    22 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    dynamic programming
    0 references
    polynomially solvable special case
    0 references
    0 references