A hybrid algorithm for the unbounded knapsack problem (Q1013302)

From MaRDI portal
Revision as of 19:40, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A hybrid algorithm for the unbounded knapsack problem
scientific article

    Statements

    A hybrid algorithm for the unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    0 references
    branch and bound
    0 references
    dynamic programming
    0 references
    algorithm engineering
    0 references