The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373)

From MaRDI portal
Revision as of 11:20, 18 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
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
scientific article

    Statements

    The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 1999
    0 references
    industrial applications
    0 references
    industrial cutting stock problems
    0 references
    dynamic programming
    0 references

    Identifiers