An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207543.2010.493535 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066520832 / rank | |||
Normal rank | |||
Revision as of 23:56, 19 March 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
