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

From MaRDI portal
Revision as of 13:34, 2 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57186020, #quickstatements; #temporary_batch_1714653054045)
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