An exact algorithm for the pallet loading problem
From MaRDI portal
Recommendations
- Solving the pallet loading problem
- scientific article; zbMATH DE number 3945878
- A fast algorithm for two-dimensional pallet loading problems of large size
- A simple and effective recursive procedure for the manufacturer's 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
Cites work
- scientific article; zbMATH DE number 3717339 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- Algorithm 457: finding all cliques of an undirected graph
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Determining the number of internal stability of a graph
- Packing the maximum number of m n tiles in a large p q rectangle
- The Theory and Computation of Knapsack Functions
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
Cited in
(47)- A note on an L-approach for solving the manufacturer's pallet loading problem
- Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
- An algorithm of global optimization for solving layout problems
- A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
- Experiments with a strategic oscillation algorithm for the pallet loading problem
- Efficient automated pallet loading
- An Experimental Study of Algorithms for Controlling Palletizers
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Exact algorithms for a loading problem with bounded clique width
- The G4-Heuristic for the Pallet Loading Problem
- How to use structural constraints to compute an upper bound for the pallet loading problem
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
- A two-stage packing problem procedure
- An exact depth-first algorithm for the pallet loading problem
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- 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
- Analysis of upper bounds for the pallet loading problem
- A fast algorithm for two-dimensional pallet loading problems of large size
- Computing stable loads for pallets
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Exact algorithms for the order picking problem
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- A tabu search algorithm for the pallet loading problem
- Packing problems
- An improved typology of cutting and packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An analytical model for the container loading problem
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A branch-and-cut algorithm for the pallet loading problem
- Optimising the palletisation of cylinders in cases
- The pallet loading problem: a review of solution methods and computational experiments
- Solving the pallet loading problem
- The pallet packing problem for non-uniform box sizes
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Stability aspects of pallet loading
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Improving palletisation efficiency—the theoretical basis and practical application
- Palletisation efficiency as a criterion for product design
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- A family of genetic algorithms for the pallet loading problem
This page was built for publication: An exact algorithm for the pallet loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820701)
