An object-based evolutionary algorithm for solving nesting problems (Q5444463): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Using a tabu search approach for solving the two-dimensional irregular cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to two-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches to irregular nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the minimal-area convex enclosure problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches for the nesting of two-dimensional shapes for press tool design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction and separation algorithms for non-convex polygons and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite stock cutting through simulated annealing / rank
 
Normal rank

Latest revision as of 17:52, 27 June 2024

scientific article; zbMATH DE number 5240580
Language Label Description Also known as
English
An object-based evolutionary algorithm for solving nesting problems
scientific article; zbMATH DE number 5240580

    Statements

    An object-based evolutionary algorithm for solving nesting problems (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2008
    0 references
    0 references
    nesting
    0 references
    evolutionary algorithms
    0 references
    cutting and packing
    0 references
    combinatorial optimization
    0 references
    0 references