An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555)

From MaRDI portal
Revision as of 07:00, 5 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
An exact algorithm for the budget-constrained multiple knapsack problem
scientific article

    Statements

    An exact algorithm for the budget-constrained multiple knapsack problem (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    multiple knapsack problem
    0 references
    branch-and-bound
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references

    Identifiers