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

From MaRDI portal
Revision as of 10:52, 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
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