A minimal algorithm for the multiple-choice knapsack problem (Q1388832)

From MaRDI portal
Revision as of 12:25, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58826519, #quickstatements; #temporary_batch_1712201099914)
scientific article
Language Label Description Also known as
English
A minimal algorithm for the multiple-choice knapsack problem
scientific article

    Statements

    title
    A minimal algorithm for the multiple-choice knapsack problem (English)
    0 references
    author
    David Pisinger
    0 references
    publication date
    11 June 1998
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    90C39
    0 references
    90C09
    0 references
    90C60
    0 references
    zbMATH DE Number
    1162850
    0 references
    zbMATH Keywords
    knapsack problem
    0 references
    dynamic programming
    0 references
    reduction
    0 references
    multiple-choice knapsack problem
    0 references
    partitioning
    0 references
    Wikidata QID
    Q58826519
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1388832&oldid=33236141"
    Powered by MediaWiki