A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697)

From MaRDI portal
Revision as of 17:56, 24 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
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
scientific article

    Statements

    A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2018
    0 references
    packing
    0 references
    cutting
    0 references
    branch and bound
    0 references
    non-guillotine
    0 references
    best-fit
    0 references

    Identifiers