An exact depth-first algorithm for the pallet loading problem
From MaRDI portal
(Redirected from Publication:1303552)
Recommendations
Cites work
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A typology of cutting and packing problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- An exact algorithm for the pallet loading problem
- How to use structural constraints to compute an upper bound for the pallet loading problem
- Loading Multiple Pallets
- Packing problems
- 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
(11)- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
- 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
- A fast algorithm for two-dimensional pallet loading problems of large size
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- A tabu search algorithm for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- The pallet loading problem: a review of solution methods and computational experiments
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
This page was built for publication: An exact depth-first 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 Q1303552)
