Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244): 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 07:55, 5 March 2024

scientific article
Language Label Description Also known as
English
Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
scientific article

    Statements

    Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (English)
    0 references
    0 references
    0 references
    29 July 2016
    0 references
    cutting stock
    0 references
    variable neighborhood search
    0 references
    dynamic programming
    0 references

    Identifiers