A best-first branch-and-bound algorithm for orthogonal rectangular packing problems (Q6850486)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8167000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A best-first branch-and-bound algorithm for orthogonal rectangular packing problems |
scientific article; zbMATH DE number 8167000 |
Statements
A best-first branch-and-bound algorithm for orthogonal rectangular packing problems (English)
0 references
2 March 2026
0 references
