A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:28, 1 February 2024
scientific article
| 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 |
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
