Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124)

From MaRDI portal
Revision as of 02:02, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1161018
Language Label Description Also known as
English
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
scientific article; zbMATH DE number 1161018

    Statements

    Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (English)
    0 references
    0 references
    0 references
    0 references
    10 August 1998
    0 references
    0 references
    valid inequalities
    0 references
    optimal Lagrangian multipliers
    0 references
    branch-and-bound
    0 references
    0 references