Approximate algorithms for constrained circular cutting problems (Q1433164): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated container loading software for pulp and paper industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated patterns of dense packings of equal disks in a square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing different-sized circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An and-or-graph approach for two-dimensional cutting problems / rank
 
Normal rank

Latest revision as of 17:01, 6 June 2024

scientific article
Language Label Description Also known as
English
Approximate algorithms for constrained circular cutting problems
scientific article

    Statements

    Approximate algorithms for constrained circular cutting problems (English)
    0 references
    0 references
    0 references
    15 June 2004
    0 references
    best local position
    0 references
    circular cutting problem
    0 references
    combinatorial optimization
    0 references
    genetic algorithms
    0 references
    heuristics
    0 references

    Identifiers