Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873)

From MaRDI portal
Revision as of 16:15, 9 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
Upper and lower bounding procedures for the multiple knapsack assignment problem
scientific article

    Statements

    Upper and lower bounding procedures for the multiple knapsack assignment problem (English)
    0 references
    0 references
    0 references
    4 February 2015
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    multiple knapsack problem
    0 references
    assignment problem
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references

    Identifiers