On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199)

From MaRDI portal
Revision as of 15:33, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
scientific article

    Statements

    On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (English)
    0 references
    0 references
    25 August 2005
    0 references
    0 references
    Polynomial algorithm
    0 references
    Complexity
    0 references
    Minmax regret optimization
    0 references
    0 references