A hybrid algorithm for the unbounded knapsack problem (Q1013302)

From MaRDI portal
Revision as of 22:42, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A hybrid algorithm for the unbounded knapsack problem
scientific article

    Statements

    title
    A hybrid algorithm for the unbounded knapsack problem (English)
    0 references
    author
    Vincent Poirriez
    0 references
    Rumen Andonov
    0 references
    Nicolas Yanev
    0 references
    publication date
    17 April 2009
    0 references
    zbMATH Keywords
    branch and bound
    0 references
    dynamic programming
    0 references
    algorithm engineering
    0 references
    describes a project that uses
    CPLEX
    0 references
    Knapsack
    0 references

    Identifiers

    zbMATH DE Number
    5544692
    0 references
    Wikidata QID
    Q56050292
    0 references
    OpenAlex ID
    W2119064613
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1013302&oldid=32025131"
    Powered by MediaWiki