One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214)

From MaRDI portal
Revision as of 11:57, 5 August 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
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
scientific article

    Statements

    One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references