An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074)

From MaRDI portal
Revision as of 22:08, 12 June 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
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
scientific article

    Statements

    Identifiers