Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search |
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
