A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2018.04.014 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129956574 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2018.04.014 / rank | |||
Normal rank | |||
Latest revision as of 01:03, 11 December 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
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
