Complexity results and exact algorithms for robust knapsack problems (Q2247901)

From MaRDI portal
Revision as of 17:25, 8 July 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
Complexity results and exact algorithms for robust knapsack problems
scientific article

    Statements

    Complexity results and exact algorithms for robust knapsack problems (English)
    0 references
    0 references
    0 references
    30 June 2014
    0 references
    knapsack problem
    0 references
    robustness
    0 references
    scenario-relaxation algorithm
    0 references
    NP-hardness
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references

    Identifiers