Computing stable loads for pallets
From MaRDI portal
Recommendations
Cites work
- A branch-and-cut algorithm for the pallet loading problem
- A three-dimensional pallet loading method for single-size boxes
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An exact algorithm for the pallet loading problem
- An improved typology of cutting and packing problems
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Practical Considerations of the Pallet-Loading Problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Solving the pallet loading problem
- Stability aspects of pallet loading
- The G4-Heuristic for the Pallet Loading Problem
Cited in
(5)- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
- Priority-based bin packing with subset constraints
- The pallet-loading vehicle routing problem with stability constraints
- Order and static stability into the strip packing problem
This page was built for publication: Computing stable loads for pallets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992703)