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

From MaRDI portal
Revision as of 03:01, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for knapsack with divisible item sizes
scientific article

    Statements

    title
    A polynomial-time algorithm for knapsack with divisible item sizes (English)
    0 references
    author
    Wim F. J. Verhaegh
    0 references
    Emile H. L. Aarts
    0 references
    Wim F. J. Verhaegh
    0 references
    publication date
    26 May 2016
    0 references
    zbMATH DE Number
    6585415
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    combinatorial problems
    0 references
    knapsack
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q287072&oldid=12169721"
    Powered by MediaWiki