A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697)
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: A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem |
scientific article; zbMATH DE number 6902947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem |
scientific article; zbMATH DE number 6902947 |
Statements
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (English)
0 references
12 July 2018
0 references
packing
0 references
cutting
0 references
branch and bound
0 references
non-guillotine
0 references
best-fit
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
