An efficient approach for large-scale two-dimensional guillotine cutting stock problems (Q3157808)
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 2130121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient approach for large-scale two-dimensional guillotine cutting stock problems |
scientific article; zbMATH DE number 2130121 |
Statements
An efficient approach for large-scale two-dimensional guillotine cutting stock problems (English)
0 references
19 January 2005
0 references
combinatorial optimisation
0 references
cutting problem
0 references
dynamic programming
0 references
heuristics
0 references
knapsack problem
0 references
0.8800074458122253
0 references
0.8740862011909485
0 references
0.861246645450592
0 references
