One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255)
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: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model |
scientific article; zbMATH DE number 6577182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model |
scientific article; zbMATH DE number 6577182 |
Statements
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (English)
0 references
4 May 2016
0 references
cutting stock
0 references
open stacks
0 references
pattern sequencing
0 references
integer linear programming
0 references
0 references
0 references
0.8582950234413147
0 references
0.8362666368484497
0 references
0.8359532952308655
0 references
0.8329166173934937
0 references
0.8285729289054871
0 references
