A hybrid algorithm for the unbounded knapsack problem (Q1013302)

From MaRDI portal
Revision as of 14:02, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56050292, #quickstatements; #temporary_batch_1707303357582)
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
    0 references