Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:22, 3 February 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
29 July 2016
0 references
cutting stock
0 references
variable neighborhood search
0 references
dynamic programming
0 references
