An exact algorithm for the pallet loading problem (Q1820701)
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: Publication:1820701 |
scientific article; zbMATH DE number 3995462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the pallet loading problem |
scientific article; zbMATH DE number 3995462 |
Statements
An exact algorithm for the pallet loading problem (English)
0 references
1987
0 references
The two-dimensional packing problem of finding optimal layouts for identical rectangular boxes on a rectangular pallet has interested OR practitioners for many years. The problem is NP-complete and solution methods to date tend to be heuristic. This paper discusses the development of an exact tree search algorithm based on a graph-theoretic model of the problem.
0 references
pallet loading
0 references
two-dimensional packing
0 references
rectangular boxes
0 references
rectangular pallet
0 references
NP-complete
0 references
heuristic
0 references
exact tree search algorithm
0 references
0.8669073581695557
0 references
0.8598858714103699
0 references
0.8477934002876282
0 references
