The pallet loading problem: a review of solution methods and computational experiments
From MaRDI portal
(Redirected from Publication:2803259)
Recommendations
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- Solving the pallet loading problem
- Improving palletisation efficiency—the theoretical basis and practical application
- Practical Considerations of the Pallet-Loading Problem
- scientific article; zbMATH DE number 3945878
Cites work
- scientific article; zbMATH DE number 3945878 (Why is no real title available?)
- A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- A branch-and-cut algorithm for the pallet loading problem
- A family of genetic algorithms for the pallet loading problem
- A fast algorithm for two-dimensional pallet loading problems of large size
- A note on an L-approach for solving the manufacturer's pallet loading problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- A tabu search algorithm for the pallet loading problem
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- An AND/OR-graph approach to the container loading problem
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- An exact algorithm for the pallet loading problem
- An exact depth-first algorithm for the pallet loading problem
- An improved typology of cutting and packing problems
- Analysis of upper bounds for the pallet loading problem
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
- Determining an upper bound for a class of rectangular packing problems
- Experiments with a strategic oscillation algorithm for the pallet loading problem
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- How to use structural constraints to compute an upper bound for the pallet loading problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Loading Multiple Pallets
- Optimal packing and covering in the plane are NP-complete
- Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
- Packing the maximum number of m n tiles in a large p q rectangle
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Solving the pallet loading problem
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- Some experiments with simulated annealing techniques for packing problems
- The G4-Heuristic for the Pallet Loading Problem
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- The minimum size instance of a Pallet Loading Problem equivalence class
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- Upper bounds for the homogeneous case of a two-dimensional packing problem
Cited in
(29)- A note on an L-approach for solving the manufacturer's pallet loading problem
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- Exact solution techniques for two-dimensional cutting and packing
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- An Experimental Study of Algorithms for Controlling Palletizers
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- The G4-Heuristic for the Pallet Loading Problem
- Manufacturer's mixed pallet design problem
- How to use structural constraints to compute an upper bound for the pallet loading problem
- A two-stage packing problem procedure
- Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
- Systematic reviews as a metaknowledge tool: caveats and a review of available options
- On the optimal layout of a dining room in the era of COVID‐19 using mathematical optimization
- The minimum size instance of a Pallet Loading Problem equivalence class
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- Priority-based bin packing with subset constraints
- A tetris beam search algorithm for the distributor's pallet loading problem
- The two-dimensional orthogonal packing problem with item fragmentation: formulation and local search-based algorithms (applications on tank-farm layout planning)
- The pallet loading problem: three-dimensional bin packing with practical constraints
- A tabu search algorithm for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- On the multiple optimal solutions and patterns of the pallet loading problem
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
This page was built for publication: The pallet loading problem: a review of solution methods and computational experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803259)
