Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647)

From MaRDI portal
Revision as of 14:15, 23 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58826501, #quickstatements; #temporary_batch_1711196317277)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
scientific article

    Statements

    title
    Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (English)
    0 references
    author
    Silvano Martello
    0 references
    David Pisinger
    0 references
    Paolo Toth
    0 references
    publication date
    12 February 2012
    0 references
    zbMATH Keywords
    knapsack problem
    0 references
    dynamic programming
    0 references
    branch-and-bound
    0 references
    surrogate relaxation
    0 references

    Identifiers

    DOI
    10.1287/mnsc.45.3.414
    0 references
    Mathematics Subject Classification ID
    90C29
    0 references
    90C27
    0 references
    90C57
    0 references
    zbMATH DE Number
    6005759
    0 references
    OpenAlex ID
    W2156293131
    0 references
    Wikidata QID
    Q58826501
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3116647&oldid=33187248"
    Powered by MediaWiki