UGC: An algorithm for two-stage unconstrained guillotine cutting (Q1127189)
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: UGC: An algorithm for two-stage unconstrained guillotine cutting |
scientific article; zbMATH DE number 1189562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | UGC: An algorithm for two-stage unconstrained guillotine cutting |
scientific article; zbMATH DE number 1189562 |
Statements
UGC: An algorithm for two-stage unconstrained guillotine cutting (English)
0 references
5 May 1999
0 references
knapsack problems
0 references
two-dimensional cutting
0 references
branch-and-bound
0 references
0.9214696288108826
0 references
0.8552159667015076
0 references
0.8452458381652832
0 references
0.8417655825614929
0 references
