Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
From MaRDI portal
Cited in
(22)- Determining an upper bound for a class of rectangular packing problems
- An analytical model for the container loading problem
- Knowledge based approach to the cutting stock problem
- Packing problems
- A branch-and-cut algorithm for the pallet loading problem
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- An improved typology of cutting and packing problems
- The pallet loading problem: a review of solution methods and computational experiments
- Upper bounds for the homogeneous case of a two-dimensional packing problem
- The pallet packing problem for non-uniform box sizes
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- Relaxation techniques applied to some loading problems
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- A fast algorithm for two-dimensional pallet loading problems of large size
- The computer as an aid to physical distribution management
- On the multiple optimal solutions and patterns of the pallet loading problem
- The semi-online robotic pallet loading problem
- A tetris beam search algorithm for the distributor's pallet loading problem
- Stability aspects of pallet loading
- Sensitivity analysis for pallet loading
- Entwicklung und Einsatz eines PC-Programms fuer das Problem der Palettenbeladung mit Pharmaprodukten via Kartonverpackung. (Development and application of a PC-program for the problem of loading palettes with card-board boxes containing pharmacentical products)
- Computing stable loads for pallets
This page was built for publication: Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917881)