A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380)

From MaRDI portal
Revision as of 00:02, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1723859
Language Label Description Also known as
English
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
scientific article; zbMATH DE number 1723859

    Statements

    A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting stock problem
    0 references
    heuristics
    0 references
    knapsack problem
    0 references
    GRASP
    0 references
    tabu search
    0 references
    path relinking
    0 references
    0 references
    0 references