A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766)

From MaRDI portal
Revision as of 17:32, 5 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56324179, #quickstatements; #temporary_batch_1707149277123)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for solving the multiple-choice knapsack problem
scientific article

    Statements

    A branch and bound algorithm for solving the multiple-choice knapsack problem (English)
    0 references
    0 references
    1984
    0 references
    pegging test
    0 references
    multiple-choice knapsack problem
    0 references
    branch and bound algorithm
    0 references
    Computational experience
    0 references
    comparisons
    0 references

    Identifiers