A new upper bound for the multiple knapsack problem (Q2668625)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A new upper bound for the multiple knapsack problem
scientific article

    Statements

    A new upper bound for the multiple knapsack problem (English)
    0 references
    0 references
    7 March 2022
    0 references
    0 references
    multiple knapsack problem
    0 references
    sequential relaxation
    0 references
    upper bound
    0 references
    divisible sizes
    0 references
    0 references
    0 references
    0 references