A polynomial-time algorithm for knapsack with divisible item sizes (Q287072)

From MaRDI portal
Revision as of 11:45, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for knapsack with divisible item sizes
scientific article

    Statements

    A polynomial-time algorithm for knapsack with divisible item sizes (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    computational complexity
    0 references
    combinatorial problems
    0 references
    knapsack
    0 references
    0 references