Computing closely matching upper and lower bounds on textile nesting problems (Q1296780): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An approach to two-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing techniques for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches to irregular nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the nesting problem in the textile manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nesting problem in the leather manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00049-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084566137 / rank
 
Normal rank

Latest revision as of 10:52, 30 July 2024

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