Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349)

From MaRDI portal
Revision as of 22:24, 18 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 1-, 2- and 3-dimensional on-line bin packing algorithms
scientific article

    Statements

    Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (English)
    0 references
    0 references
    0 references
    0 references
    1 August 1995
    0 references
    suboptimal algorithms
    0 references
    asymptotic worst case ratio
    0 references
    1-dimensional bin packing
    0 references
    lower bounds
    0 references

    Identifiers