A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2800796761 / rank | |||
Normal rank | |||
Revision as of 00:49, 20 March 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
