Heuristic and exact methods for the cutting sequencing problem (Q1303545)
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: Heuristic and exact methods for the cutting sequencing problem |
scientific article; zbMATH DE number 1337801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic and exact methods for the cutting sequencing problem |
scientific article; zbMATH DE number 1337801 |
Statements
Heuristic and exact methods for the cutting sequencing problem (English)
0 references
16 September 1999
0 references
cutting stock
0 references
cutting sequencing
0 references
greedy algorithm
0 references
tabu search
0 references
generalized local search
0 references
heuristic
0 references
0 references
0.9188702
0 references
0.91458964
0 references
0.9085357
0 references
0.9025904
0 references
0.8894204
0 references
0.88861144
0 references
0.8807511
0 references
0.87938446
0 references
0.8789629
0 references
