Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2014.11.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993974091 / rank | |||
Normal rank | |||
Revision as of 20:31, 19 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
29 July 2016
0 references
cutting stock
0 references
variable neighborhood search
0 references
dynamic programming
0 references
