An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574)
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: An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems |
scientific article; zbMATH DE number 6690465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems |
scientific article; zbMATH DE number 6690465 |
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
0 references
0 references
0 references
0 references
0.9377108216285706
0 references
0.8376932144165039
0 references
0.8321565985679626
0 references
0.821488618850708
0 references
