Sciweavers

SIU
2002
67views more  SIU 2002»
13 years 11 months ago
A Tight Lagrangean Relaxation Bound for the Manufacturer's Pallet Loading Problem
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes
Reinaldo Morabito, Randal Farago
EOR
2007
88views more  EOR 2007»
13 years 11 months ago
The minimum size instance of a Pallet Loading Problem equivalence class
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
Gustavo H. A. Martins, Robert F. Dell
EOR
2008
82views more  EOR 2008»
13 years 11 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell