A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514)

From MaRDI portal
Revision as of 12:30, 13 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
A bound and bound algorithm for the zero-one multiple knapsack problem
scientific article

    Statements

    A bound and bound algorithm for the zero-one multiple knapsack problem (English)
    0 references
    0 references
    0 references
    1981
    0 references
    bound and bound algorithm
    0 references
    zero-one multiple knapsack problem
    0 references
    tree- search technique
    0 references
    computational results
    0 references
    integer linear programming
    0 references

    Identifiers