A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 11:11, 18 March 2024
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
