A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
From MaRDI portal
Publication:3748071
Recommendations
Cited in
(17)- How to use structural constraints to compute an upper bound for the pallet loading problem
- An analytical model for the container loading problem
- Packing problems
- An exact depth-first algorithm for the pallet loading problem
- A tabu search algorithm for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- Efficient automated pallet loading
- Solving the pallet loading problem
- The pallet loading problem: a review of solution methods and computational experiments
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
- A note on an L-approach for solving the manufacturer's pallet loading problem
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- An Experimental Study of Algorithms for Controlling Palletizers
- Experiments with a strategic oscillation algorithm for the pallet loading problem
- On the multiple optimal solutions and patterns of the pallet loading problem
- The minimum size instance of a Pallet Loading Problem equivalence class
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
This page was built for publication: A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748071)