A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. |
scientific article |
Statements
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (English)
0 references
17 November 2003
0 references
Cutting problem
0 references
Optimization
0 references
Branch and bound
0 references
0 references
