Algorithms for the one-dimensional two-stage cutting stock problem (Q724047): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2800285872 / rank | |||
Normal rank | |||
Latest revision as of 23:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the one-dimensional two-stage cutting stock problem |
scientific article |
Statements
Algorithms for the one-dimensional two-stage cutting stock problem (English)
0 references
25 July 2018
0 references
cutting
0 references
two-stage cutting stock problem
0 references
column-and-row generation
0 references
problems with column-dependent-rows
0 references
