One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576)

From MaRDI portal
Revision as of 11:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
One-dimensional cutting stock problem to minimize the number of different patterns
scientific article

    Statements

    One-dimensional cutting stock problem to minimize the number of different patterns (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting stock problem
    0 references
    pattern minimization
    0 references
    local search
    0 references
    metaheuristics
    0 references
    pattern generation
    0 references
    0 references