A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5989115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns |
scientific article; zbMATH DE number 5989115 |
Statements
A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (English)
0 references
18 December 2011
0 references
two-dimensional cutting
0 references
cutting stock
0 references
T-shape patterns
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9020055532455444
0 references
0.8679132461547852
0 references
0.8462947607040405
0 references
0.8403215408325195
0 references
