A branch-and-cut algorithm for the pallet loading problem
Authors:
- R. Alvarez-ValdesRAR. Alvarez-Valdes
- F. ParreñoFPF. Parreño
- J.M. TamaritJTJ.M. Tamarit
- 1 November 2005
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (11) , 3007-3029
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped piecesJournal of the Operational Research Society, 2003
- A fast algorithm for two-dimensional pallet loading problems of large sizeEuropean Journal of Operational Research, 2001
- Experiments with a strategic oscillation algorithm for the pallet loading problemInternational Journal of Production Research, 2001
- A simple and effective recursive procedure for the manufacturer's pallet loading problemJournal of the Operational Research Society, 1998
- A family of genetic algorithms for the pallet loading problemAnnals of Operations Research, 1996
- The G4-Heuristic for the Pallet Loading ProblemJournal of the Operational Research Society, 1996
- How to use structural constraints to compute an upper bound for the pallet loading problemEuropean Journal of Operational Research, 1995
- An Application of the Micro to Product Design and DistributionJournal of the Operational Research Society, 1982
- An Algorithm to Optimize the Layout of Boxes in PalletsJournal of the Operational Research Society, 1980
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock ProblemManagement Science, 1979