A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980)

From MaRDI portal
Revision as of 22:26, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
scientific article

    Statements

    A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2010
    0 references
    bin packing
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    0 references
    0 references
    0 references

    Identifiers