Heuristic and exact methods for the cutting sequencing problem (Q1303545): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Glass cutting in a small firm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for sequencing cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Establishing the optimality of sequencing heuristics for cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved heuristics for sequencing cutting patterns / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00268-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987445021 / rank
 
Normal rank

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
Heuristic and exact methods for the cutting sequencing problem
scientific article

    Statements

    Heuristic and exact methods for the cutting sequencing problem (English)
    0 references
    16 September 1999
    0 references
    cutting stock
    0 references
    cutting sequencing
    0 references
    greedy algorithm
    0 references
    tabu search
    0 references
    generalized local search
    0 references
    heuristic
    0 references

    Identifiers