An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry (Q3779982)
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 4041604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry |
scientific article; zbMATH DE number 4041604 |
Statements
An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry (English)
0 references
1988
0 references
real-life cutting-stock
0 references
elimination of order spread
0 references
pattern allocation
0 references
cutting sequencing
0 references
two-stage procedure
0 references
two-dimensional pattern- allocation problem
0 references
travelling-salesman
0 references
3-optimal method
0 references
0.7993793487548828
0 references
0.7929654717445374
0 references
0.7829822897911072
0 references
0.778157114982605
0 references
