Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196)
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: Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem |
scientific article; zbMATH DE number 6814362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem |
scientific article; zbMATH DE number 6814362 |
Statements
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (English)
0 references
1 December 2017
0 references
0.8886161
0 references
0.88782376
0 references
0.8798567
0 references
0.8788365
0 references
0.87761736
0 references
0 references
0.87458813
0 references
0.87356305
0 references
0.87056166
0 references
