Computing closely matching upper and lower bounds on textile nesting problems (Q1296780)

From MaRDI portal
Revision as of 10:56, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing closely matching upper and lower bounds on textile nesting problems
scientific article

    Statements

    Computing closely matching upper and lower bounds on textile nesting problems (English)
    0 references
    0 references
    0 references
    3 August 1999
    0 references
    packing
    0 references
    nesting
    0 references
    industrial cutting problem
    0 references
    textile manufacturing
    0 references
    lower bounds
    0 references
    upper bounds
    0 references
    simulated annealing
    0 references
    branch-and-bound methods
    0 references

    Identifiers