The G4-Heuristic for the Pallet Loading Problem
From MaRDI portal
Recommendations
- An exact algorithm for the pallet loading problem
- The pallet loading problem: a review of solution methods and computational experiments
- scientific article; zbMATH DE number 1873246
- A tabu search algorithm for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- An efficient approach for the multi-pallet loading problem
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- A heuristic algorithm for container loading of pallets with infill boxes
- Heuristics for the container loading problem
Cited in
(41)- 4-block heuristic for the rectangle packing problem
- Heuristic procedures for minimizing makespan and the number of required pallets
- The cutting stock problem in a hardboard industry: A case study.
- An efficient approach for the multi-pallet loading problem
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
- A branch-and-cut algorithm for the pallet loading problem
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- The exact solutions of several types of container loading problems
- Improved flow-based formulations for the skiving stock problem
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Solving the pallet loading problem
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- 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
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A heuristic method based on Lagrangean relaxation for a 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
- Matheuristics: survey and synthesis
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
- The multiple container loading cost minimization problem
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
- On the multiple optimal solutions and patterns of the pallet loading problem
- Column (and row) generation algorithms for the pallet loading problem
- Integrated optimization of pallet selection and truck loading with multiple pallet sizes under axle weight and stability constraints
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- 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
- Layer-layout-based heuristics for loading homogeneous items into a single container
- Computing stable loads for pallets
This page was built for publication: The G4-Heuristic for the Pallet Loading Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717141)