A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. |
scientific article; zbMATH DE number 2005452
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. |
scientific article; zbMATH DE number 2005452 |
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
