Yet harder knapsack problems (Q653327)

From MaRDI portal
Revision as of 20:13, 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
Yet harder knapsack problems
scientific article

    Statements

    title
    Yet harder knapsack problems (English)
    0 references
    author
    Georg Schnitger
    0 references
    Stasys P. Jukna
    0 references
    publication date
    9 January 2012
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    90C39
    0 references
    zbMATH DE Number
    5995827
    0 references
    zbMATH Keywords
    branch and bound
    0 references
    dynamic programming
    0 references
    memoization
    0 references
    branching program
    0 references
    knapsack
    0 references
    perfect matching
    0 references
    OpenAlex ID
    W2082847241
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q653327&oldid=35261281"
    Powered by MediaWiki