A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite stock cutting through simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random search in the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank

Latest revision as of 18:38, 4 June 2024

scientific article
Language Label Description Also known as
English
A genetic algorithm solution for one-dimensional bundled stock cutting
scientific article

    Statements

    A genetic algorithm solution for one-dimensional bundled stock cutting (English)
    0 references
    0 references
    17 November 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting
    0 references
    genetic algorithms
    0 references
    linear programming
    0 references
    integer programming
    0 references
    heuristics
    0 references