Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:37, 5 March 2024

scientific article
Language Label Description Also known as
English
Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
scientific article

    Statements

    Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (English)
    0 references
    0 references
    15 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting stock
    0 references
    depth-first search
    0 references
    dynamic programming
    0 references
    hill-climbing
    0 references
    heuristics
    0 references
    knapsacking
    0 references