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

From MaRDI portal
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