A constructive periodicity bound for the unbounded knapsack problem (Q1758270)

From MaRDI portal
Revision as of 22:54, 26 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 constructive periodicity bound for the unbounded knapsack problem
scientific article

    Statements

    A constructive periodicity bound for the unbounded knapsack problem (English)
    0 references
    0 references
    8 November 2012
    0 references
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    knapsack problem
    0 references
    periodicity
    0 references