An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:19, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems |
scientific article |
Statements
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (English)
0 references
1 March 2017
0 references
two-dimensional cutting problem
0 references
optimisation
0 references
branch-and-bound
0 references
