Lower bounds for a bin packing problem with linear usage cost (Q1755229)

From MaRDI portal
Revision as of 20:56, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lower bounds for a bin packing problem with linear usage cost
scientific article

    Statements

    Lower bounds for a bin packing problem with linear usage cost (English)
    0 references
    0 references
    9 January 2019
    0 references
    packing
    0 references
    combinatorial optimization
    0 references
    lower bounds
    0 references
    performance ratio
    0 references
    branch and bound
    0 references

    Identifiers