Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859)

From MaRDI portal
Revision as of 14:55, 28 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5039992
Language Label Description Also known as
English
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
scientific article; zbMATH DE number 5039992

    Statements

    Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (English)
    0 references
    0 references
    0 references
    11 July 2006
    0 references
    online approximation algorithm
    0 references
    asymptotic worst case ratio
    0 references
    bin covering problem
    0 references
    bin packing problem
    0 references
    longest item
    0 references
    uniform sized bins
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references