An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169)

From MaRDI portal
Revision as of 06:43, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An empirical analysis of exact algorithms for the unbounded knapsack problem
scientific article

    Statements

    An empirical analysis of exact algorithms for the unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    28 March 2019
    0 references
    combinatorial optimization
    0 references
    unbounded knapsack problem
    0 references
    dynamic programming
    0 references
    integer programming
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references