An exact algorithm for the pallet loading problem (Q1820701): 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.1016/0377-2217(87)90140-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066368232 / rank | |||
Normal rank | |||
Revision as of 00:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the pallet loading problem |
scientific article |
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
