A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985)

From MaRDI portal
Revision as of 14:07, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
scientific article

    Statements

    A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (English)
    0 references
    0 references
    0 references
    13 December 2010
    0 references
    0 references
    cutting and packing problems
    0 references
    constrained two-dimensional guillotine cutting patterns
    0 references
    dynamic programming
    0 references
    and/or-graph search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references