A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050)

From MaRDI portal
Revision as of 18:56, 9 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
A note on upper bounds to the robust knapsack problem with discrete scenarios
scientific article

    Statements

    A note on upper bounds to the robust knapsack problem with discrete scenarios (English)
    0 references
    0 references
    27 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    branch-and-bound
    0 references
    robust knapsack problem
    0 references
    max-min optimization
    0 references
    0 references