On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications (Q4888190)

From MaRDI portal
Revision as of 19:07, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 909760
Language Label Description Also known as
English
On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
scientific article; zbMATH DE number 909760

    Statements

    On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications (English)
    0 references
    0 references
    0 references
    28 October 1996
    0 references
    0 references
    max-min 0-1 knapsack problem
    0 references
    multiple scenarios
    0 references
    approximation algorithm
    0 references
    branch-and-bound
    0 references
    0 references