A linear time bin-packing algorithm (Q1062626)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A linear time bin-packing algorithm
scientific article

    Statements

    A linear time bin-packing algorithm (English)
    0 references
    0 references
    1985
    0 references
    In the bin-packing problem a list L of numbers in (0,1] is to be packed into unit capacity bins. Let \(L^*\) denote the minimum number of bins required. We present a linear time bin-packing algorithm for the off-line version of this problem. The algorithm uses at most \((4/3)L^*+2\) bins.
    0 references
    cutting stock
    0 references
    off-line bin-packing
    0 references
    linear time bin-packing algorithm
    0 references

    Identifiers